Abstract
The genomic distance typically describes the minimum number of large-scale mutations that transform one genome into another. Classical approaches to compute the genomic distance are usually limited to genomes with the same content and take into consideration only rearrangements that change the organization of the genome (i.e., positions and orientation of pieces of DNA, and number of chromosomes). In order to handle genomes with distinct contents, also insertions and deletions of pieces of DNA—named indels—must be allowed. Some extensions of the classical approaches lead to models that allow rearrangements and indels. In this work we introduce a new graph structure that gives a unified view of these approaches, present an overview of their results and point out some open problems related to them.
This research was supported by the agency CNPq (PROMETRO 563087/10-2).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bafna, V., Pevzner, P.: Genome rearrangements and sorting by reversals. In: Proc. of FOCS, pp. 148–157 (1993)
Bergeron, A., Mixtacki, J., Stoye, J.: A unifying view of genome rearrangements. In: Bücher, P., Moret, B.M.E. (eds.) WABI 2006. LNCS (LNBI), vol. 4175, pp. 163–173. Springer, Heidelberg (2006)
Braga, M.D.V., Machado, R., Ribeiro, L.C., Stoye, J.: Genomic distance under gene substitutions. BMC Bioinformatics 12(suppl. 9), S8 (2011)
Braga, M.D.V., Machado, R., Ribeiro, L.C., Stoye, J.: On the weight of indels in genomic distances. BMC Bioinformatics 12(suppl. 9), S13 (2011)
Braga, M.D.V., Willing, E., Stoye, J.: Double cut and join with insertions and deletions. J. Comp. Biol. 18(9), 1167–1184 (2011); A preliminary version appeared in Moulton, V., Singh, M. (eds.): WABI 2010. LNCS (LNBI), vol. 6293. Springer, Heidelberg (2010)
da Silva, P.H., Machado, R., Dantas, S., Braga, M.D.V.: Restricted DCJ-indel model: sorting linear genomes with DCJ and indels. In: Proc. of RECOMB-CG 2012, BMC Bioinformatics, vol. 13-S9, p. S14 (2012)
da Silva, P.H., Braga, M.D.V., Machado, R., Dantas, S.: DCJ-indel distance with distinct operation costs. In: Raphael, B., Tang, J. (eds.) WABI 2012. LNCS (LNBI), vol. 7534, pp. 378–390. Springer, Heidelberg (2012)
El-Mabrouk, N.: Sorting signed permutations by reversals and insertions/deletions of contiguous segments. J. of Disc. Alg. 1(1), 105–122 (2001)
Hannenhalli, S., Pevzner, P.: Transforming men into mice (polynomial algorithm for genomic distance problem). In: Proc. of FOCS, pp. 581–592 (1995)
Hannenhalli, S., Pevzner, P.: Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J. of the ACM 46, 1–27 (1999); A preliminary version appeared in Proc. of STOC 1995
Kovác, J., Warren, R., Braga, M.D.V., Stoye, J.: Restricted DCJ model (the problem of chromosome reincorporation). J. Comp. Biol. 18(9), 1231–1241 (2011)
Meidanis, J., Walter, M.E.M.T., Dias, Z.: Reversal distance of signed circular chromosomes. Technical Report IC-00-23, University of Campinas (2000)
Tannier, E., Zheng, C., Sankoff, D.: Multichromosomal median and halving problems under different genomic distances. BMC Bioinformatics 10(120) (2009)
Yancopoulos, S., Attie, O., Friedberg, R.: Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21 (2005)
Yancopoulos, S., Friedberg, R.: DCJ path formulation for genome transformations which include insertions, deletions, and duplications. J. Comp. Biol. 16(10), 1311–1338 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Braga, M.D.V. (2013). An Overview of Genomic Distances Modeled with Indels. In: Bonizzoni, P., Brattka, V., Löwe, B. (eds) The Nature of Computation. Logic, Algorithms, Applications. CiE 2013. Lecture Notes in Computer Science, vol 7921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39053-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-39053-1_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39052-4
Online ISBN: 978-3-642-39053-1
eBook Packages: Computer ScienceComputer Science (R0)