A faster and simpler algorithm for sorting signed permutations by reversals

SIAM Journal on Computing

Volumn 29, Issue 3, 2000, Pages 880-892

  Kaplan, Haim ^a   Shamir, Ron ^a   Tarjan, Robert E ^b,c  

^a TEL AVIV UNIVERSITY   (Israel)

^b Princeton University   (United States)

^c Intertrust Technologies Corporation   (United States)

Author keywords

Computational molecular biology; Reversal distance; Sorting permutations

Indexed keywords

DATA STRUCTURES; FUNCTIONS; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING;

COMPUTATIONAL MOLECULAR BIOLOGY; PERMUTATIONS; REVERSALS;

ALGORITHMS;

EID: 0033295439     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539798334207     Document Type: Article

References (26)

1. W. ACKERMANN, Zum hilbertshen aufbau der reelen zahlen, Math. Ann., 99 (1928), pp. 118-133.
2. V. BAFNA AND P. PEVZNER, Sorting permutations by transpositions, in Proceedings of the 6th Annual Symposium on Discrete Algorithms, ACM, New York, 1995, pp. 614-623.
3. V. BAFNA AND P. A. PEVZNER, Genome rearragements and sorting by reversals, SIAM J. Comput., 25 (1996), pp. 272-289.
4. A preliminary version appeared in Proceedings of the 34th IEEE Symposium of the Foundations of Computer Science, IEEE, Los Alamitos, CA, pp. 148-157, 1994.
5. P. BERMAN AND S. HANNENHALLI, Fast sorting by reversals, in Combinatorial Pattern Matching, Lecture Notes in Comput. Sci. 1075, Springer, Berlin, 1996, pp. 168-185.
6. A. CAPRARA, Sorting by reversals is difficult, in Proceedings of the First International Conference on Computational Molecular Biology (RECOMB), ACM, New York, 1997, pp. 75-83.
7. D. A. CHRISTIE, A 3/2-approximation algorithm for sorting by reversals, in Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 98), ACM Press, New York, 1998, pp. 244-252.
8. T. DOBZHANSKY AND A. H. STURTEVANT, Inversions in the chromosomes of Drosophila pseudoobscura, Genetics, 23 (1938), pp. 28-64.
9. M. C. GOLUMBIC, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
10. S. HANNENHALLI, Polynomial algorithm for computing translocation distance between genomes, Discrete Appl. Math., 71 (1996), pp. 137-151.
11. S. HANNENHALLI AND P. PEVZNER, Transforming men into mice (polynomial algorithm for genomic distance problems, in Proceedings of the IEEE Symposium on the Foundations of Computer Science, 1995, pp. 581-592.
12. S. HANNENHALLI AND P. A. PEVZNER, Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals), in Proceedings of the 27th annual ACM Symposium on Theory of Computing, Las Vegas, NV, 1995, pp. 178-189.
13. S. B. HOOT AND J. D. PALMER, Structural rearrangements, including parallel inversions, within the chloroplast genome of Anemone and related genera, J. Molecular Evolution, 38 (1994), pp. 274-281.
14. H. KAPLAN, R. SHAMIR, AND R. E. TARJAN, Faster and simpler algorithm for sorting signed permutations by reversals, in Proceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms, ACM-SIAM, 1997, pp. 344-351.
15. Also in Proceedings of the First International Conference on Computational Molecular Biology (RECOMB), ACM, New York, 1997, p. 163.
16. J. KECECIOGLU AND R. RAVI, Physical mapping of chromosomes using unique probes, in Proceedings of the 6th annual ACM-SIAM Symposium on Discrete Algorithms (SODA 95), ACM Press, New York, 1995, pp. 604-613.
17. J. KECECIOGLU AND D. SANKOFF, Efficient bounds for oriented chromosome inversion distance, in Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching, Lecture Notes in Comput. Sci. 807, Springer, Berlin, 1994, pp. 307-325.
18. J. KECECIOGLU AND D. SANKOFF, Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement, Algorithmica, 13 (1995), pp. 180-210.
19. A preliminary version appeared in Proceedings CPM 93, Springer, Berlin, 1993, pp. 87-105 .
20. J. D. PALMER AND L. A. HERBON, Tricircular mitochondrial genomes of Brassica and Raphanus: reversal of repeat configurations by inversion, Nucleid Acids Research, 14 (1986), pp. 9755-9764.
21. J. D. PALMER AND L. A. HERBON, Unicircular structure of the Brassica hirta mitochondrial genome, Current Genetics, 11 (1987), pp. 565-570.
22. J. D. PALMER AND L. A. HERBON, Plant mitochondrial DNA evolves rapidly in structure, but slowly in sequence, J. Molecular Evolution, 28 (1988), pp. 87-97.
23. J. D. PALMER, B. OSORIO, AND W. THOMPSON, Evolutionalry significance of inversions in legume chloroplast DNAs, Current Genetics, 14 (1988), pp. 65-74.
24. D. SANKOFF, Edit distance for genome comparison based on nonlocal operations, in Combinatorial Pattern Matching, Lecture Notes in Comput. Sci. 644, Springer, Berlin, 1992, pp. 121-135.
25. D. SANKOFF, R. CEDERGREN, AND Y. ABEL, Genomic divergence through gene rearrangement., Methods in Enzymology, 183 (1990), pp. 428-438.
26. R. E. TARJAN, Efficiency of a good but not linear set union algorithm, J. ACM, 22 (1979), pp. 215-225.