Polynomial-time algorithm for computing translocation distance between genomes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 937, Issue , 1995, Pages 162-176

  Hannenhalli, Sridhar ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957880805     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60044-2_41     Document Type: Conference Paper

References (15)

1. [1] V. Bafna and P. Pevzner. Genome rearrangements and sorting by reversals. In 34th IEEE Syrup. on Foundations of Computer Science, pages 148-157, 1993. (to appear in SIAM J. Computing).
2. [2] V. Bafna and P. Pevzner. Sorting by reversals: Genome rearrangements in plant organelles and evolutionary history of X chromosome. Mol. Biol. and Evol., 12:239-246, 1995.
3. [3] V. Bafna and P. Pevzner. Sorting by transpositions. In Proc. of 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 614-623, 1995b.
4. [4] N. G. Copeland, N. A. Jenkins, D. J. Gilbert, J. T. Eppig, L. J. Maltals, 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:57-65, 1993.
5. [5] S. Hannenhalli, C. Chappey, E. Koonin, and P. Pevzner. Scenarios for genome rearrangements: Herpesvirus evolution as a test case. In Proc. of 3rd Intl. Conference on Bioinformatics and Complex Genome Analysis, pages 91-106, 1995.
6. [6] S. Hannenhalli and P. Pevzner. Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). In Proc. of 27th Annual ACM Symposium on the Theory of Computing, 1995a. (to appear).
7. [7] S. Hannenhalli and P. Pevzner. Reversals do not cut long strips. Technical Report: CSE-94-074, Department of Computer Science and Engineering, The Pennsylvania State University, 1995c.
8. [8] J. Kececioglu and R. Ravi. Of mice and men: Evolutionary distances between genomes under translocation. In Proc. of 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 604-613, 1995.
9. [9] J. Kececioglu and D. Sankoff. Exact and approximation algorithms for the inversion distance between two permutations. In Proc. of 4th Ann. Symp. on Combinatorial Pattern Matching, Lecture Notes in Computer Science 684, pages 87-105. Springer Verlag, 1993. (Extended version has appeared in Algorithmica, 13: 180-210, 1995.).
10. [10] J. Kececioglu and D. Sankoff. Efficient bounds for oriented chromosome inversion distance. In Proc. of 5th Ann. Symp. on Combinatorial Pattern Matching, Lecture Notes in Computer Science 807, pages 307-325. Springer Verlag, 1994.
11. [11] B. Lewin. Genes V. Oxford University Press, 1994.
12. [12] D. Sankoff. Edit distance for genome comparison based on non-local operations. In Proc. of 3rd Ann. Symp. on Combinatorial Pattern Matching, Lecture Notes in Computer Science 644, pages 121-135. Springer Verlag, 1992.
13. [13] D. Sankoff, R. Cedergren, and Y. Abel. Genomic divergence through gene rearrangement. In Molecular Evolution: Computer Analysis of Protein and Nucleic Acid Sequences, chapter 26, pages 428-438. Academic Press, 1990.
14. [14] 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. Natl. Acad. Sci. USA, 89:6575-6579, 1992.
15. [15] E. Therman and M. Susman. Human Chromosomes, structure, behavior, and effects. Springer-Verlag, 1993.