Genomic distances under deletions and insertions

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

Volumn 2697, Issue , 2003, Pages 537-547

  Marron, Mark ^a   Swenson, Krister M ^a   Moret, Bernard M E ^a  

^a University of New Mexico   (United States)

Author keywords

Genomic distance; Hannenhalli Pevzner; Inversion distance; Reversal distance

Indexed keywords

EID: 35248897530     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45071-8_54     Document Type: Article

References (16)

1. D.A. Bader, B.M.E. Moret, and M. Yan. A fast linear-time algorithm for inversion distance with an experimental comparison. J. Comput. Biol., 8(5):483-491, 2001.
2. D. Bryant. The complexity of calculating exemplar distances. In D. Sankoff and J. Nadeau, editors, Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families, pages 207-212. Kluwer Academic Pubs., Dordrecht, Netherlands, 2000.
3. A. Caprara. Sorting by reversals is difficult. In Proc. 1st Int'l Conf. on Comput. Mol. Biol. RECOMB97, pages 75-83. ACM Press, 1997.
4. A. Caprara. Formulations and hardness of multiple sorting by reversals. In Proc. 3rd Int'l Conf. on Comput. Mol. Biol. RECOMB99, pages 84-93. ACM Press, 1999.
5. A. Caprara. On the practical solution of the reversal median problem. In Proc. 1st Workshop on Algs. in Bioinformatics WABI 2001, volume 2149 of Lecture Notes in Computer Science, pages 238-251. Springer-Verlag, 2001.
6. M. Cosner, R. Jansen, B.M.E. Moret, L. Raubeson, L. Wang, T. Warnow, and S. Wyman. An empirical comparison of phylogenetic methods on chloroplast gene order data in Campanulaceae. In D. Sankoff and J. Nadeau, editors, Comparative Genomics, pages 99-122. Kluwer Acad. Pubs., 2000.
7. S. Downie and J. Palmer. Use of chloroplast DNA rearrangements in reconstructing plant phytogeny. In P. Soltis, D. Soltis, and J. Doyle, editors, Plant Molecular Systematics, pages 14-35. Chapman and Hall, 1992.
8. N. El-Mabrouk. Genome rearrangement by reversals and insertions/deletions of contiguous segments. In Proc. 11th Ann. Symp. Combin. Pattern Matching CPM 00, volume 1848 of Lecture Notes in Computer Science, pages 222-234. Springer-Verlag, 2000.
9. S. Hannenhalli and P. Pevzner. Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). In Proc. 27th Ann. Symp. Theory of Computing STOC 95, pages 178-189. ACM Press, 1995.
10. B.M.E. Moret, A.C. Siepel, J. Tang, and T. Liu. Inversion medians outperform breakpoint medians in phylogeny reconstruction from gene-order data. In R. Guigo and D. Gusfield, editors, Proc. 2nd Int'l Workshop Algorithms in Bioinformatics (WABI'02), volume 2452 of Lecture Notes in Computer Science, pages 521-536. Springer-Verlag, 2002.
11. R. Olmstead and J. Palmer. Chloroplast DNA systematics: a review of methods and data analysis. Amer. J. Bot., 81:1205-1224, 1994.
12. J. Palmer. Chloroplast and mitochondrial genome evolution in land plants. In R. Herrmann, editor, Cell Organelles, pages 99-133. Springer Verlag, 1992.
13. I. Pe'er and R. Shamir. The median problems for breakpoints are NP-complete. Elec. Colloq. on Comput. Complexity, 71, 1998.
14. L. Raubeson and R. Jansen. Chloroplast DNA evidence on the ancient evolutionary split in vascular land plants. Science, 255:1697-1699, 1992.
15. D. Sankoff. Genome rearrangement with gene families. Bioinformatics, 15(11):909-917, 1999.
16. A.C. Siepel and B.M.E. Moret. Finding an optimal inversion median: Experimental results. In O. Gascuel and B.M.E. Moret, editors, Proc. 1st Int'l Workshop Algorithms in Bioinformatics (WABI'01), volume 2149 of Lecture Notes in Computer Science, pages 189-203. Springer-Verlag, 2001.