Transforming Cabbage into Turnip: Polynomial Algorithm for Sorting Signed Permutations by Reversals

Journal of the ACM

Volumn 46, Issue 1, 1999, Pages 1-22

  Hannenhalli, Sridhar ^a   Pevzner, Pavel A ^b  

^a GLAXOSMITHKLINE   (United Kingdom)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

Algorithms; Computational biology; F.1.3 Computation by Abstract Devices : Modes of Computation; G.2.1 Discrete Mathematics : Combinatorics; Genetics; J.3 Life and Medical Sciences : biology and genetics; Performance

Indexed keywords

EID: 0002856077     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/300515.300516     Document Type: Article

References (29)

1. AIGNER, M., AND WEST, D. B. 1987. Sorting by insertion of leading element. J. Combin. Theory 45, 306-309.
2. BAFNA, V., AND PEVZNER, P. 1995. Sorting by reversals: Genome rearrangements in plant organelles and evolutionary history of X chromosome. Mol. Biol. Biol. 12, 239-246.
3. BAFNA, V., AND PEVZNER, P. 1996. Genome rearrangements and sorting by reversals. SIAM J. Comput. 25, 272-289.
4. BAFNA, V., AND PEVZNER, P. 1998. Sorting by transpositions. SIAM J. Disc. Math. 11, 224-240.
5. BERMAN, P., AND HANNENHALLI, S. 1996. Fast sorting by reversals. In Combinatorial Pattern Matching, Proceedings of the 6th Annual Symposium (CPM'96). Lecture Notes in Computer Science. Springer-Verlag, Berlin, Germany, pp. 168-185.
6. CAPRARA, A. 1997. Sorting by reversals is difficult. In Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB9T). pp. 75-83.
7. COHEN, D., AND BLUM, M. 1993. Improved bounds for sorting pancakes under a conjecture, Manuscript.
8. EVEN, S., AND GOLDREICH, O. 1981. The minimum-length generator sequence problem is NP-hard. J. Algorithms 2, 311-313.
9. GATES, W. H., AND PAPADIMITRIOU, C. H. 1979. Bounds for sorting by prefix reversals. Disc. Math. 27, 47-57.
10. HANNENHALLI, S. 1995. Polynomial algorithm for computing translocation distance between genomes. In Combinatorial Pattern Matching, Proceedings of the 6th Annual Symposium (CPM'95). Lecture Notes in Computer Science. Springer-Verlag, Berlin, Germany, pp. 162-176.
11. HANNENHALLI, S., CHAPPEY, C., KOONIN, E., AND PEVZNER, P. 1995. Genome sequence comparison and scenarios for gene rearrangements: A test case. Genomics, 30, 299-311.
12. HANNENHALLI, S., AND PEVZNER, P. 1995. Transforming men into mice (polynomial algorithm for genomic distance problem). In Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 581-592.
13. HANNENHALLI, S., AND PEVZNER, P. 1996. To cut . . . or not to cut (applications of comparative physical maps in molecular evolution). In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms (Atlanta, Ga., Jan. 28-30). ACM, New York, pp. 304-313.
14. HEYDARI, M., AND SUDBOROUGH, I. H. 1993. On sorting by prefix reversals and the diameter of pancake networks, Manuscript.
15. JERRUM, M. 1985. The complexity of finding minimum-length generator sequences. Theoret. Comput. Sci. 36, 265-289.
16. KECECIOGLU, J., AND GUSFIELD, D. 1994. Reconstructing a history of recombinations from a set of sequences. In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, pp. 471-480.
17. KECECIOGLU, J., AND RAVI, R. 1995. Of mice and men: Algorithms for evolutionary distances between genomes with translocation. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, Calif., Jan. 22-24). ACM, New York, pp. 604-613.
18. KECECIOGLU, J., AND SANKOFF, D. 1995. Exact and approximation algorithms for the inversion distance between two permutations. Algorithmica 13, 180-210.
19. KECECIOGLU, J., AND SANKOFF, D. 1994. Efficient bounds for oriented chromosome inversion distance. In Combinatorial Pattern Matching, Proceedings of the 5th Annual Symposium (CPM'94). Lecture Notes in Computer Science, vol. 807. Springer-Verlag, Berlin, Germany, pp. 307-325.
20. MAKAROFF, C. A., AND PALMER, J. D. 1988. Mitochondrial DNA rearrangements and transcriptional alterations in the male sterile cytoplasm of Ogura radish. Mol. Cell. Biol. 8, 1474-1480.
21. NADEAU, J. H., AND TAYLOR, B. A. 1984. Lengths of chromosomal segments conserved since divergence of man and mouse. Proc. Natl. Acad. Sci. USA 81, 814-818.
22. PALMER, J. D., AND HERBON, L. A. 1988. Plant mitochondrial DNA evolves rapidly in structure, but slowly in sequence. J. Mol. Evolut. 27, 87-97.
23. PEVZNER, P. A., AND WATERMAN, M. S. 1995. Open combinatorial problems in computational molecular biology. In Proceedings of the 3rd Israel Symposium on Theory of Computing and Systems. IEEE Computer Society Press, Los Alamitos, Calif., pp. 158-163.
24. SANKOFF, D. 1992. Edit distance for genome comparison based on non-local operations. In Combinatorial Pattern Matching, Proceedings of the 3rd Annual Symposium (CPM'92). Lecture Notes in Computer Science, vol. 644. Springer-Verlag, Berlin, Germany, pp. 121-135.
25. SANKOFF, D., CEDERGREN, R., AND ABEL, Y. 1990. Genomic divergence through gene rearrangement. In Molecular Evolution: Computer Analysis of Protein and Nucleic Acid Sequences, Chap. 26. Academic Press, Orlando, Fla., pp. 428-438.
26. SANKOFF, D., LEDUC, G., ANTOINE, N., PAQUIN, B., LANG, B. F., AND CEDERGREN, R. 1992. Gene order comparisons for phylogenetic inference: Evolution of the mitochondrial genome. Proc. Natl. Acad. Sci. USA 89, 6575-6579.
27. STURTEVANT, A. H., AND DOBZHANSKY, T. 1936. Inversions in the third chromosome of wild races of drosophila pseudoobscura, and their use in the study of the history of the species. Proc. Nat. Acad. Sci. 22, 448-450.
28. TARJAN, R., KAPLAN, H., AND SHAMIR, R. 1997. Faster and simpler algorithm for sorting by reversals. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, pp. 614-623.
29. WATTERSON, G. A., EWENS, W. J., HALL, T. E., AND MORGAN, A. 1982. The chromosome inversion problem. J. Theoret. Biol. 99, 1-7.