Abstract
Alignments of sequences are widely used for biological sequence comparisons. Only biological events like mutations, insertions and deletions are usually modeled and other biological events like inversions are not automatically detected by the usual alignment algorithms.
Alignment with inversions does not have a known polynomial algorithm and a simplification to the problem that considers only non-overlapping inversions were proposed by Schöniger and Waterman [20] in 1992 as well as a corresponding O(n 6) solution. An improvement to an algorithm with O(n 3 logn)-time complexity was announced in an extended abstract [1] and, in this present paper, we give an algorithm that solves this simplified problem in O(n 3)-time and O(n 2)-space in the more general framework of an edit graph.
Inversions have recently [4,7,13,17] been discovered to be very important in Comparative Genomics and Scherer et al. in 2005 [11] experimentally verified inversions that were found to be polymorphic in the human genome. Moreover, 10% of the 1,576 putative inversions reported overlap RefSeq genes in the human genome. We believe our new algorithms may open the possibility to more detailed studies of inversions on DNA sequences using exact optimization algorithms and we hope this may be particularly interesting if applied to regions around known rearrangements boundaries. Scherer report 29 such cases and prioritize them as candidates for biological and evolutionary studies.
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
Alves, C.E.R., do Lago, A.P., Vellozo, A.F.: Alignment with non-overlapping inversions in \(O(n\sp 3\log n)\)-time. In: Proceedings of GRACO2005. Electron. Notes Discrete Math, vol. 19, pp. 365–371. Elsevier, Amsterdam (2005)
Bader, D.A., Moret, B.M.E., Yan, M.: A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. Journal of Computational Biology 8(5), 483–491 (2001)
Caprara, A.: Sorting permutations by reversals and Eulerian cycle decompositions. SIAM J. Discrete Math. 12(1), 91–110 (1999) (electronic)
Cerdeño-Tárraga, Patrick, Crossman, Blakely, Abratt, Lennard, Poxton, Duerden, Harris, Quail, Barron, Clark, Corton, Doggett, Holden, Larke, Line, Lord, Norbertczak, Ormond, Price, Rabbinowitsch, Woodward, Barrell, Parkhill: Extensive DNA inversions in the B. fragilis genome control variable gene expression. Science 307(5714), 1463–1465 (2005)
Chen, X., Zheng, J., Fu, Z., Nan, P., Zhong, Y., Lonardi, S., Jiang, T.: Assignment of orthologous genes via genome rearrangement. IEEE/ACM Trans. Comput. Biol. Bioinformatics 2(4), 302–315 (2005)
Christie, D.A.: A 3/2-approximation algorithm for sorting by reversals. In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, CA, 1998), pp. 244–252. ACM, New York (1998)
Cáceres, Ranz, Barbadilla, Long, Ruiz: Generation of a widespread Drosophila inversion by a transposable element. Science 285(5426), 415–418 (1999)
do Lago, A.P., Kulikowski, C.A., Linton, E., Messing, J., Muchnik, I.: Comparative genomics: simultaneous identification of conserved regions and their rearrangements through global optimization. In: The Second University of Sao Paulo/Rutgers University Biotechnology Conference, Rutgers University Inn and Conference Center, New Brunswick, NJ (August 2001)
do Lago, A.P., Muchnik, I., Kulikowski, C.: An O(n 4) algorithm for alignment with non-overlapping inversions. In: Second Brazilian Workshop on Bioinformatics, WOB 2003, Macaé, RJ, Brazil (2003), http://www.ime.usp.br/~alair/wob03.pdf
do Lago, A.P., Muchnik, I., Kulikowski, C.: A sparse dynamic programming algorithm for alignment with non-overlapping inversions. Theor. Inform. Appl. 39(1), 175–189 (2005)
Feuk, MacDonald, Tang, Carson, Li, Rao, Khaja, Scherer: Discovery of human inversion polymorphisms by comparative analysis of human and chimpanzee DNA sequence assemblies. PLoS Genet. 1(4), 56 (2005)
Gao, Y., Wu, J., Niewiadomski, R., Wang, Y., Chen, Z.-Z., Lin, G.: A space efficient algorithm for sequence alignment with inversions. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol. 2697, pp. 57–67. Springer, Heidelberg (2003)
Graham, Olmstead: Evolutionary significance of an unusual chloroplast DNA inversion found in two basal angiosperm lineages. Curr. Genet. 37(3), 183–188 (2000)
Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. In: ACM Symposium on Theory of Computing, pp. 178–189. Association for Computing Machinery (1995)
Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J. ACM 46(1), 1–27 (1999)
Kececioglu, J., Sankoff, D.: Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement. Algorithmica 13(1-2), 180–210 (1995)
Kuwahara, Yamashita, Hirakawa, Nakayama, Toh, Okada, Kuhara, Hattori, Hayashi, Ohnishi: Genomic analysis of Bacteroides fragilis reveals extensive DNA inversions regulating cell surface adaptation. Proceedings of the National Academy of Sciences U S A 101(41), 14919–14924 (2004)
Landau, G.M., Ziv-Ukelson, M.: On the common substring alignment problem. J. Algorithms 41(2), 338–359 (2001)
Schmidt, J.P.: All highest scoring paths in weighted grid graphs and their application to finding all approximate repeats in strings. SIAM J. Comput. 27(4), 972–992 (1998) (electronic)
Schöniger, M., Waterman, M.S.: A local algorithm for DNA sequence alignment with inversions. Bulletin of Mathematical Biology 54(4), 521–536 (1992)
Tannier, E., Sagot, M.-F.: Sorting by reversals in subquadratic time. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol. 3109, pp. 1–13. Springer, Heidelberg (2004)
Wagner, R.: On the complexity of the extended string-to-string correction problem. In: Seventh ACM Symposium on the Theory of Computation, Association for Computing Machinery (1975)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vellozo, A.F., Alves, C.E.R., do Lago, A.P. (2006). Alignment with Non-overlapping Inversions in O(n 3)-Time. In: Bücher, P., Moret, B.M.E. (eds) Algorithms in Bioinformatics. WABI 2006. Lecture Notes in Computer Science(), vol 4175. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11851561_18
Download citation
DOI: https://doi.org/10.1007/11851561_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-39583-6
Online ISBN: 978-3-540-39584-3
eBook Packages: Computer ScienceComputer Science (R0)