Abstract
As more and more genomes are sequenced, evolutionary biologists are becoming increasingly interested in evolution at the level of whole genomes, in scenarios in which the genome evolves through insertions, deletions, and movements of genes along its chromosomes. In the mathematical model pioneered by Sankoff and others, a unichromosomal genome is represented by a signed permutation of a multi-set of genes; Hannenhalli and Pevzner showed that the edit distance between two signed permutations of the same set can be computed in polynomial time when all operations are inversions. El-Mabrouk extended that result to allow deletions and a limited form of insertions (which forbids duplications). In this paper we extend El-Mabrouk’s work to handle duplications as well as insertions and present an alternate framework for computing (near) minimal edit sequences involving insertions, deletions, and inversions. We derive an error bound for our polynomial-time distance computation under various assumptions and present preliminary experimental results that suggest that performance in practice may be excellent, within a few percent of the actual distance.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
A. Caprara. Sorting by reversals is difficult. In Proc. 1st Int’l Conf. on Comput. Mol. Biol. RECOMB97, pages 75–83. ACM Press, 1997.
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.
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.
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.
S. Downie and J. Palmer. Use of chloroplast DNA rearrangements in reconstructing plant phylogeny. In P. Soltis, D. Soltis, and J. Doyle, editors, Plant Molecular Systematics, pages 14–35. Chapman and Hall, 1992.
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.
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.
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.
R. Olmstead and J. Palmer. Chloroplast DNA systematics: a review of methods and data analysis. Amer. J. Bot., 81:1205–1224, 1994.
J. Palmer. Chloroplast and mitochondrial genome evolution in land plants. In R. Herrmann, editor, Cell Organelles, pages 99–133. Springer Verlag, 1992.
I. Pe’er and R. Shamir. The median problems for breakpoints are NP-complete. Elec. Colloq. on Comput. Complexity, 71, 1998.
L. Raubeson and R. Jansen. Chloroplast DNA evidence on the ancient evolutionary split in vascular land plants. Science, 255:1697–1699, 1992.
D. Sankoff. Genome rearrangement with gene families. Bioinformatics, 15(11):909–917, 1999.
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’lWorkshop Algorithms in Bioinformatics (WABI’01), volume 2149 of Lecture Notes in Computer Science, pages 189–203. Springer-Verlag, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Marron, M., Swenson, K.M., Moret, B.M.E. (2003). Genomic Distances under Deletions and Insertions. In: Warnow, T., Zhu, B. (eds) Computing and Combinatorics. COCOON 2003. Lecture Notes in Computer Science, vol 2697. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45071-8_54
Download citation
DOI: https://doi.org/10.1007/3-540-45071-8_54
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40534-4
Online ISBN: 978-3-540-45071-9
eBook Packages: Springer Book Archive