基于最大权值路径算法的DNA多序列比对方法-软件学报.PDFVIP

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software, Vol.18, No.2, February 2007, pp .185−195 http://www.j DOI: 10. 1360/jos1 80185 Tel/Fax : +86-10 © 2007 by Journal of Software. All rights reserved. ∗ 基于最大权值路径算法的DNA 多序列比对方法 + 霍红卫 , 肖智伟 (西安电子科技大学 计算机学院,陕西 西安 710071) A Multiple Alignment Approach for DNA Sequences Based on the Maximum Weighted Path Algorithms + HUO Hong-Wei , XIAO Zhi-Wei (School of Computer Science and Technology, Xidian University, Xi’an 710071, China) + Corresponding author: Phn: +86-29 Fax: +86-29 E-mail: hwhuo@mail.xidian . Huo HW, Xiao ZW. A multiple alignment approach for DNA sequences based on the maximum weighted path algorithms. Journal of Software, 2007,18(2):185−195. /1000-9825/18/185.htm Abstract: For multiple sequences alignment problem in molecular biological sequence analysis, when the input sequence number is very large, many heuristic algorithms have been proposed to improve the computation speed and the quality of alignment. An approach called MWPAlign (maximum weighted path alignment) is presented to do global multiple alignment for DNA sequences. In this method, a de Bruijn graph is used to express the input sequences information, which is recorded in the edges of the graph. As a result, a consensus-finding problem can be transformed to a maximum weighted path problem of the graph. MWPAlign obtains almost linear computation speed of the multiple sequences alignment problem. Experimental results show that the proposed algorithm is feasible, and for