Abstract
The double-cut and join (DCJ) is a genomic operation that generalizes the typical mutations to which genomes are subject. The distance between two genomes, in terms of number of DCJ operations, can be computed in linear time. More powerful is the DCJ-indel model, which handles genomes with unequal contents, allowing, besides the DCJ operations, the insertion and/or deletion of pieces of DNA – named indel operations. It has been shown that the DCJ-indel distance can also be computed in linear time, assuming that the same cost is assigned to any DCJ or indel operation. In the present work we consider a new DCJ-indel distance in which the indel cost is distinct from and upper bounded by the DCJ cost. Considering that the DCJ cost is equal to 1, we set the indel cost equal to a positive constant w ≤ 1 and show that the distance can still be computed in linear time. This new distance generalizes the previous DCJ-indel distance considered in the literature (which uses the same cost for both types of operations).
This research was partially supported by the Brazilian agencies CNPq and FAPERJ.
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.
References
Hannenhalli, S., Pevzner, P.: Transforming men into mice (polynomial algorithm for genomic distance problem). In: Proc. of FOCS, pp. 581–592 (1995)
Yancopoulos, S., Attie, O., Friedberg, R.: Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21, 3340–3346 (2005)
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)
El-Mabrouk, N.: Sorting signed permutations by reversals and insertions/deletions of contiguous segments. Journal of Discrete Algorithms 1(1), 105–122 (2001)
Hannenhalli, S., Pevzner, P.: Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. Journal of the ACM 46, 1–27 (1999)
Yancopoulos, S., Friedberg, R.: DCJ path formulation for genome transformations which include insertions, deletions, and duplications. Journal of Computational Biology 16(10), 1311–1338 (2009)
Braga, M.D.V., Willing, E., Stoye, J.: Double cut and join with insertions and deletions. Journal of Computational Biology 18(9), 1167–1184 (2011); A preliminary version appeared in: Braga, M.D.V., Willing, E., Stoye, J.: Genomic Distance with DCJ and Indels. In: Moulton, V., Singh, M. (eds.) WABI 2010. LNCS (LNBI), vol. 6293, pp. 90–101. Springer, Heidelberg (2010)
Blanc, G., Ogata, H., Robert, C., et al.: Reductive genome evolution from the mother of rickettsia. PLoS Genetics 3(1), e14 (2007)
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., Stoye, J.: The solution space of sorting by DCJ. Journal of Computational Biology 17(9), 1145–1165 (2010)
Braga, M.D.V., Machado, R., Ribeiro, L.C., Stoye, J.: Genomic distance under gene substitutions. BMC Bioinformatics 12(suppl. 9), S8 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
da Silva, P.H., Braga, M.D.V., Machado, R., Dantas, S. (2012). DCJ-indel Distance with Distinct Operation Costs. In: Raphael, B., Tang, J. (eds) Algorithms in Bioinformatics. WABI 2012. Lecture Notes in Computer Science(), vol 7534. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33122-0_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-33122-0_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33121-3
Online ISBN: 978-3-642-33122-0
eBook Packages: Computer ScienceComputer Science (R0)