Multiple genome rearrangement and breakpoint phylogeny

Journal of Computational Biology

Volumn 5, Issue 3, 1998, Pages 555-570

  Sankoff, David ^a   Blanchette, Mathieu ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

AMINO ACID SUBSTITUTION; CHROMOSOME INVERSION; COMPUTER SIMULATION; CONFERENCE PAPER; DIAGNOSTIC ACCURACY; DNA SEQUENCE; DNA TRANSPOSITION; GENE DELETION; GENE INSERTION; GENE REARRANGEMENT; GENETIC PROCEDURES; GENOME; PHYLOGENY; PRIORITY JOURNAL;

EID: 0031721577     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.1998.5.555     Document Type: Conference Paper

References (34)

1. Bafna, V., and Pevzner, P.A. 1996. Genome rearrangements and sorting by reversals. SIAM Journal of Computing 25, 272-289.
2. Bafna, V., and Pevzner, P.A. 1995. Sorting by transpositions, Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, 614-623.
3. Blanchette, M., Bourque, G., and Sankoff, D. 1997. Breakpoint phylogenies, 25-34. In Miyano, S., and Takagi, T., eds., Genome Informatics 1997, Universal Academy Press, Tokyo.
4. Blanchette, M., Kunisawa, T., and Sankoff, D. 1996. Parametric genome rearrangement. Gene-Combis (online) and Gene 172, GC11-17.
5. Caprara, A. 1997a. Sorting by reversals is difficult, 75-83. In Proceedings of the First Annual International Conference on Computational Molecular Biology (RECOMB 97), ACM, New York.
6. Caprara, A. 1997b. Formulations and complexity of multiple sorting by reversals, ms., University of Bologna.
7. DasGupta, B., Jiang, T., Kannan, S., Li, M., and Sweedyk, Z. 1997. On the complexity and approximation of syntenic distance, 99-108. In Proceedings of the First Annual International Conference on Computational Molecular Biology (RECOMB 97), ACM, New York.
8. Ferretti, V., Nadeau, J.H., and Sankoff, D. 1996. Original synteny, 159-167. In Hirschberg, D., and Myers, G., eds., Combinatorial Pattern Matching, 7th Annual Symposium. Lecture Notes in Computer Science 1075, Springer Verlag, New York.
9. Gu, Q.-P., Iwata, K., Peng, S., and Chen, Q.-M. 1997. A heuristic algorithm for genome rearrangements, 268-269. In Miyano, S., and Takagi, T., eds., Genome Informatics 1997, Universal Academy Press, Tokyo.
10. Gusfield, D. 1997. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press.
11. Hannenhalli, S. 1995. Polynomial algorithm for computing translocation distance between genomes, 162-176. In Combinatorial Pattern Matching. 6th Annual Symposium. Lecture Notes in Computer Science, Springer Verlag, New York.
12. Hannenhalli, S., Chappey, C., Koonin, E.V., and Pevzner, P.A. 1995. Genome sequence comparison and scenarios for gene rearrangements: a test case. Genomics 30, 299-311.
13. Hannenhalli, S., and Pevzner, P.A. 1995a. Transforming cabbage into turnip. (polynomial algorithm for sorting signed-permutations by reversals), 178-189. In Proceedings of the 27th Annual ACM-SIAM Symposium on the Theory of Computing.
14. Hannenhalli, S., and Pevzner, P.A. 1995b. Transforming men into mice (polynomial algorithm for genomic distance problem), 581-592. In Proceedings of the IEEE 36th Annual Symposium on Foundations of Computer Science.
15. Kaplan, H., Shamir, R., and Tarjan, R.E. 1997. Faster and simpler algorithm for sorting signed permutations by reversals. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms.
16. Kececioglu, J., and Ravi, R. 1995. Of mice and men. Evolutionary distances between genomes under translocation, 604-613. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms.
17. Kececioglu, J., and Sankoff, D. 1993. Exact and approximation algorithms for the inversion distance between two chromosomes, 87-105. In Apostolico, A., Crochemore, M., Galil, Z., and Manber, U., eds., Combinatorial Pattern Matching. 4th Annual Symposium. Lecture Notes in Computer Science 684, Springer Verlag, New York.
18. Kececioglu, J., and Sankoff, D. 1994. Efficient bounds for oriented chromosome inversion distance, 307-325. In Crochemore, M., and Gusfield, D., eds., Combinatorial Pattern Matching. 5th Annual Symposium. Lecture Notes in Computer Science 807, Springer Verlag, New York.
19. Kececioglu, J., and Sankoff, D. 1995. Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement. Algorithmica 13, 180-210.
20. Minieka, E. 1978. Optimization Algorithms for Networks and Graphs, Industrial Engineering vol. 1. Marcel Dekker, New York.
21. Pe'er, I., and Shamir, R. 1998. The median problems for breakpoints are NP-complete. M.S., University of Washington.
22. Pevzner, P.A., and Waterman, M.S. 1995. Open combinatorial problems in computational molecular biology, 158-173. In Proceedings of the 3rd Israel Symposium on the Theory of Computing and Systems.
23. Sankoff, D. 1992. Edit distance for genome comparison based on non-local operations, 121-135. In Combinatorial Pattern Matching. 3rd Annual Symposium. Lecture Notes in Computer Science 644, Springer Verlag, New York.
24. Sankoff, D. 1997. The early introduction of dynamic programming into computational biology, 403-413. In Vinet, L., ed., Advances in the Mathematical Sciences - CRM's 25 years. CRM Proceedings and Lecture Notes 11, American Mathematical Society, Providence, RI.
25. Sankoff, D., and Blanchette, M. 1997. The median problem for breakpoints in comparative genomics, 251-263. In Jiang, T., and Lee, D.T., eds., Computing and Combinatorics, Proceedings of COCOON '97, Lecture Notes in Computer Science 1276, Springer Verlag, New York.
26. Sankoff, D., Cedergren, R.J., and Lapalme, G. 1976. Frequency of insertion-deletion, transversion, and transition in the evolution of 5S ribosomal RNA. J. Mol. Evol. 7, 133-149.
27. Sankoff, D., Ferretti, V., and Nadeau, J.H. 1997. Conserved segment identification. Journal of Computational Biology 4, 559-565.
28. Sankoff, D., Leduc, G., Antoine, N., Paquin, B., Lang, B.F., and Cedergren, R.J. 1992. Gene order comparisons for phylogenetic inference: Evolution of the mitochondrial genome. Proceedings of the National Academy of Sciences USA 89, 6575-6579.
29. Sankoff, D., Morel, C., and Cedergren, R.J. 1973. Evolution of 5S RNA and the non-randomness of base replacement. Nature New Biology 245, 232-234.
30. Sankoff, D., Sundaram, G., and Kececioglu, J. 1996. Steiner points in the space of genome rearrangements. International Journal of the Foundations of Computer Science 7, 1-9.
31. Schöniger, M., and Waterman, M.S. 1992. A local algorithm for DNA alignment with inversions. Bull. Math. Biol. 54, 521-536.
32. Setubal, J., and Meidanis, J. 1997. Introduction to Computational Molecular Biology. PWS Publishing, Boston.
33. Varré, J.-S., Delahaye, J.-P., and Rivals, E. 1997. The transformation distance, 352-353. In Miyano, S., and Takagi, T., eds., Genome Informatics 1997, Universal Academy Press, Tokyo.
34. Waterman, M.S. 1995. Introduction to Computational Biology. Chapman and Hall, London.