Finding Local Genome Rearrangements
Abstract
The Double Cut and Join (DCJ) model of genome rearrangement is well studied due to its math- ematical simplicity and power to account for the many events that transform genome architec- ture. These studies have mostly been devoted to the understanding of minimum length scenarios transforming one genome into another. In this paper we search instead for DCJ rearrangement scenarios that minimize the number of rearrangements whose breakpoints are unlikely due to some biological criteria. We establish a link between this Minimum Local Scenario (MLS) problem and the problem of finding a Maximum Edge-disjoint Cycle Packing (MECP) on an undirected graph. This link leads us to a 3/2-approximation for MLS, as well as an exact integer linear program. From a practical perspective, we briefly report on the applicability of our methods and the potential for computation of distances using a more general DCJ cost function.
Domains
Bioinformatics [q-bio.QM]Origin | Files produced by the author(s) |
---|
Loading...