Abstract
This paper presents a novel approach, called MWPAlign Maximum Weighted Path approach to multiple ALIGNment, to perform global multiple alignment of DNA sequences. In our method, de Bruijn graph is used to describe input sequences information. As a result, a consensus-finding problem can be transformed to a maximum weighted path problem of the graph. MWPAlign gets almost linear computation speed of multiple sequences alignment problem. Experimental results show that the proposed algorithm is feasible, and for large number of sequences with lower mutation rate 5.2%, MWPAlign generates better alignment and has a lower computation time as compared to CLUSTALW, T-Coffee and HMMT.
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
Thompson, J.D., Higgins, D.G., Gibson, T.J.: CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting position-specific gap penalties and weight matrix choice. Nucleic Acids Research 22(22), 4673–4680 (1994)
Notredame, C., Higgins, D.G., Heringa, J.: T-Coffee: A novel method for fast and accurate multiple sequence alignment. J. Mol. Biol. 302, 205–217 (2000)
Katoh, K., Misasa, K., Kuma, K., Miyata, T.: MAFFT: A novel method for rapid multiple sequence alignment based on fast Fourier transform. Nucleic Acids Res. 30(14), 3059–3066 (2002)
Edgar, R.C.: MUSCLE: Multiple sequence alignment with high accuracy and high throughput. Nucleic Acids Res. 32(5), 1792–1797 (2004)
Do, C.B., Brudno, M., Batzoglou, S.: ProbCons: Probabilistic consistency-based multiple alignment of amino acid sequences. Genome Research 15, 330–340 (2005)
Morgenstern, B.: DIALIGN: multiple DNA and protein sequence alignment at BibiServ. Nucleic Acids Res. 36, W33–W36 (2004)
Lee, C., Grasso, C., Sharlow, M.F.: Multiple sequence alignment using partial order graphs. Bioinformatics 18(3), 452–464 (2002)
Raphael, B., Zhi, D., Tang, H., Pevzner, P.: A novel method for multiple alignment of sequences with repeated and shuffled elements. Genome Research 14(11), 2336–2346 (2004)
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
Huo, H., Stojkovic, V., Xiao, Z. (2006). A Maximum Weighted Path Approach to Multiple Alignments for DNA Sequences. In: Jiao, L., Wang, L., Gao, X., Liu, J., Wu, F. (eds) Advances in Natural Computation. ICNC 2006. Lecture Notes in Computer Science, vol 4222. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11881223_41
Download citation
DOI: https://doi.org/10.1007/11881223_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45907-1
Online ISBN: 978-3-540-45909-5
eBook Packages: Computer ScienceComputer Science (R0)