Polynomial-time algorithm for computing translocation distance between genomes

Discrete Applied Mathematics

Volumn 71, Issue 1-3, 1996, Pages 137-151

  Hannenhalli, Sridhar ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000320128     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(96)00061-3     Document Type: Article

References (17)

1. V. Bafna and P. Pevzner, Genome rearrangements and sorting by reversals, in: Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science (1993) 148-157; SIAM J. Comput., to appear.
2. V. Bafna and P. Pevzner, Genome rearrangements and sorting by reversals, in: Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science (1993) 148-157; SIAM J. Comput., to appear.
3. V. Bafna and P. Pevzner, Sorting by reversals: genome rearrangements in plant organelles and evolutionary history of X chromosome, Mol. Biol. Evol 12 (1995) 239-246.
4. V. Bafna and P. Pevzner, Sorting by transpositions, in: Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (1995) 614-623.
5. N.G. Copeland, N.A. Jenkins, D.J. Gilbert, J.T. Eppig, L.J. Maltais, J.C. Miller, W.F. Dietrich, A. Weaver, S.E. Lincoln, R.G. Steen, L.D. Steen, J.H. Nadeau and E.S. Lander, A genetic linkage map of the mouse: current applications and future prospects, Science 262 (1993) 57-65.
6. S. Hannenhalli, C. Chappey, E. Koonin and P. Pevzner, Genome sequence comparison and scenarios for gene rearrangements: a test case, in: Genomics, Vol. 30 (1995) 299-311.
7. S. Hannenhalli and P. Pevzner, Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals), in: Proceedings of the 27th Annual ACM Symposium on the Theory of Computing (1995) 178-189.
8. S. Hannenhalli and P. Pevzner, Transforming men into mice (polynomial algorithm for genomic distance problem), in: Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science (1995) 581-592.
9. J. Kececioglu and R. Ravi, Of mice and men: evolutionary distances between genomes under translocation, in: Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (1995) 604-613.
10. J. Kececioglu and D. Sankoff, Exact and approximation algorithms for the inversion distance between two permutations, in: Combinatorial Pattern Matching, Proceedings of the 4th Annual Symposium (CPM'93). Lecture Notes in Computer Science, Vol. 684 (Springer, Berlin, 1993) 87-105; extended version has appeared in Algorithmica 13 (1995) 180-210.
11. J. Kececioglu and D. Sankoff, Exact and approximation algorithms for the inversion distance between two permutations, in: Combinatorial Pattern Matching, Proceedings of the 4th Annual Symposium (CPM'93). Lecture Notes in Computer Science, Vol. 684 (Springer, Berlin, 1993) 87-105; extended version has appeared in Algorithmica 13 (1995) 180-210.
12. J. Kececioglu and D. Sankoff, 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, Berlin, 1994) 307-325.
13. B. Lewin, Genes V (Oxford Univ. Press, Oxford, 1994).
14. D. Sankoff, 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, Berlin, 1992) 121-135.
15. D. Sankoff, R. Cedergren and Y. Abel, Genomic divergence through gene rearrangement, in: Molecular Evolution: Computer Analysis of Protein and Nucleic Acid Sequences, Ch. 26 (Academic Press, New York, 1990) 428-438.
16. D. Sankoff, G. Leduc, N. Antoine, B. Paquin, B.F. Lang and R. Cedergren, Gene order comparisons for phylogenetic inference: evolution of the mitochondrial genome, Proc. Nat. Acad. Sci. USA 89 (1992) 6575-6579.
17. E. Therman and M. Susman, Human Chromosomes, Structure, Behavior, and Effects (Springer, Berlin, 1993).