Sorting by weighted reversals, transpositions, and inverted transpositions.
During evolution, genomes are subject to genome rearrangements that alter the ordering and orientation of genes on the chromosomes. If a genome consists of a single chromosome (like mitochondrial, chloroplast, or bacterial genomes), the biologically relevant genome rearrangements are (1) inversions--also called reversals--where a section of the genome is excised, reversed in orientation, and reinserted and (2) transpositions, where a section of the genome is excised and reinserted at a new position in the genome; if this also involves an inversion, one speaks of an inverted transposition. To reconstruct ancient events in the evolutionary history of organisms, one is interested in finding an optimal sequence of genome rearrangements that transforms a given genome into another genome. It is well known that this problem is equivalent to the problem of "sorting" a signed permutation into the identity permutation. In this paper, we provide a 1.5-approximation algorithm for sorting by weighted reversals, transpositions and inverted transpositions for biologically realistic weights.
Faculty of Engineering and Computer Sciences, University of Ulm, Ulm, Germany. martin.bader@uni-ulm.de
Martin
M
Bader
Enno
E
Ohlebusch
D000465:Algorithms; D007446:Chromosome Inversion / Q000235:genetics*; D004251:DNA Transposable Elements / Q000235:genetics; D004270:DNA, Circular / Q000235:genetics; D015321:Gene Rearrangement; D016678:Genome; D023281:Genomics / Q000379:methods*; D008957:Models, Genetic; D049490:Systems Biology / Q000379:methods* / Q000639:trends
D004251:DNA Transposable Elements; D004270:DNA, Circular