Abstract
A dynamic programming algorithm to find an optimal alignment for a pair of DNA sequences has been described by Schöniger and Waterman. The alignments use not only substitutions, insertions, and deletions of single nucleotides, but also inversions, which are the reversed complements, of substrings of the sequences. With the restriction that the inversions are pairwise non-intersecting, their proposed algorithm runs in O(n 2 m 2) time and consumes O(n 2 m 2) space, where n and m are the lengths of the input sequences respectively. We develop a space efficient algorithm to compute such an optimal alignment which consumes only O(nm) space within the same amount of time. Our algorithm enables the computation for a pair of DNA sequences of length up to 10,000 to be carried out on an ordinary desktop computer. Simulation study is conducted to verify some biological facts about gene shuffling across species.
Supported in part by the Grant-in-Aid for Scientific Research of the Ministry of Education, Science, Sports and Culture of Japan, under Grant No. 14580390. Part of the work done while visiting at University of Alberta.
Corresponding author. Supported in part by NSERC grants RGPIN249633 and A008599, and a REE Startup Grant from the University of Alberta.
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
J. W. Brown. The Ribonuclease P Database. Nucleic Acids Research, 27:314, 1999.
D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge, 1997.
C. J. Howe, R. F. Barker, C. M. Bowman, and T. A. Dyer. Common features of three inversions in wheat chloroplast dna. Current Genetics, 13:343–349, 1988.
S. Muthukrishnan and S. C. Sahinalp. An improved algorithm for sequence comparison with block reversals. In Proceedings of The 5th Latin American Theoretical Informatics Symposium (LATIN’02), LNCS 2286, pages 319–325, 2002.
M. Schöniger and M. S. Waterman. A local algorithm for DNA sequence alignment with inversions. Bulletin of Mathematical Biology, 54:521–536, 1992.
R. A. Wagner. On the complexity of the extended string-to-string correction problem. In D. Sankoff and J. B. Kruskal, editors, Time Warps, Strings Edits, and Macromolecules: the Theory and Practice of Sequence Comparison, pages 215–235. Addison-Wesley, 1983.
D. X. Zhou, O. Massenet, F. Quigley, M. J. Marion, F. Monéger, P. Huber, and R. Mache. Characterization of a large inversion in the spinach chloroplast genome relative to marchantia: a possible transposon-mediated origin. Current Genetics, 13:433–439, 1988.
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
Gao, Y., Wu, J., Niewiadomski, R., Wang, Y., Chen, ZZ., Lin, G. (2003). A Space Efficient Algorithm for Sequence Alignment with Inversions. 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_8
Download citation
DOI: https://doi.org/10.1007/3-540-45071-8_8
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