This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 WRI World Congress on Computer Science and Information Engineering
Improving Kalign via Reconstruction of Phylogenetic Tree and Iteration
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
The multiple sequence alignment of DNA or protein sequences is one of the fundamental research topics in bioinformatics. Kalign is an widely used multiple sequence alignment method employing the Wu-Manber approximate string matching algorithm, which improves both the accuracy and speed of multiple sequence alignment, and it is especially well suited for the task of aligning large numbers of sequences or divergent sequences. However, the alignment quality is poor because of the inaccurate estimate of the distances between sequences. In this paper, a novel similarity measure based on matching protein subsequences is presented. Then an iterative algorithm, which combines re-estimation of distance and reconstruction of phylogenetic tree, is introduced to refine the alignment created by Kalign. As the result of experiment, we use the BAliBASE 3.0 alignment benchmark set for the assessment of our method. The result shows that our algorithm achieves more accurate alignment than Kalign does.
Index Terms:
multiple sequence alignment, Kalign, similarity measure, iteration
Citation:
Fan Yang, QingXin Zhu, MingYuan Zhao, "Improving Kalign via Reconstruction of Phylogenetic Tree and Iteration," csie, vol. 1, pp.625-629, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.