Of mice and men: Algorithms for evolutionary distances between genomes with translocation

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1995, Pages 604-613

  Kececioglu, John D ^a   Ravi, R ^b  

^a UNIVERSITY OF GEORGIA   (United States)

^b PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; BIOLOGY; CHROMOSOMES; GENES; MAMMALS;

COMBINATORIAL ALGORITHM; COMPUTATIONAL BIOLOGY; EVOLUTIONARY DISTANCE; GENOME REARRANGEMENTS; LOWER BOUNDS; OPTIMAL ALGORITHM; REARRANGEMENT MECHANISMS; THEORETICAL MODELING;

EVOLUTIONARY ALGORITHMS;

EID: 84878713670     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. Bafna, Vineet and Pavel A. Pevzner. "Genome rearrangements and sorting by reversals." Proceedings of the 34th Symposium on Foundations of Computer Science, 148-157, November 1993.
2. Bafna, Vineet and Pavel A. Pevzner. "Sorting by transpositions.'" Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms, January 1995.
3. Bafna, Vineet and Pavel A. Pevzner. "Sorting by reversals: genome rearrangements in plant organelles and evolutionary history of X chromosome." Technical Report CSE-94-032, Department of Computer Science, Pennsylvania State University, April 1994.
4. Copeland, N.G., 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. Stein, J.H. Nadeau, E.S. Lander. "A genetic linkage map of the mouse: current applications and future prospects." Science 262, 57-66, 1993.
5. Hannenhalli, Sridhar, Colombe Chappey, Eugene V. Koonin, and Pavel A. Pevzner. "Algorithms for genome rearrangements: herpesvirus evolution as a test case." To appear in Proceedings of the 3rd International Conference on Bioinformatics and Complex Genome Analysis, 1994.
6. Jerrum, Mark R. "The complexity of finding minimum-length generator sequences." Theoretical Computer Science 36, 265-289, 1985.
7. Kececioglu, John and David Sankoff. "Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement." To appear in Algorithmica, 1994. (An earlier version appeared as "Exact and approximation algorithms for the inversion distance between two chromosomes," Proceedings of the 4th Symposium on Combinatorial Pattern Matching, Springer-Verlag Lecture Notes in Computer Science 684, 87-105, June 1993.)
8. Kececioglu, John and David Sankoff. "Efficient bounds for oriented chromosome-inversion distance." Proceedings of the 5th Symposium on Combinatorial Pattern Matching, Springer-Verlag Lecture Notes in Computer Science 807, 307-325, June 1994.
9. Nadeau, Joseph H. and Benjamin A. Taylor. "Lengths of chromosomal segments conserved since divergence of man and mouse." Proceedings of the National Academy of Sciences USA 81, 814-818, 1984.
10. O'Brien, S.J., J.E. Womack, L.A. Lyons, K.J. Moore, N.A. Jenkins, and N.G. Copeland. "Anchored reference loci for comparative genome mapping in mammals." Nature Genetics 3, 103-112, 1993.
11. Sankoff, David. "Edit distance for genome comparison based on non-local operations." Proceedings of the 3rd Symposium on Combinatorial Pattern Matching, Springer-Verlag Lecture Notes in Computer Science 644, 121-135, April-May 1992.
12. Sankoff, David, Guillaume Leduc, Natalie Antoine, Bruno Paquin, B. Franz Lang, and Robert Cedergren. "Gene order comparisons for phylogenetic inference: evolution of the mitochondrial genome." Proceedings of the National Academy of Sciences USA 89, 6575-6579,1992.