一种新的迭代渐进多序列比对算法  

A New Iteratively Progressive Multiple Sequence Alignment Algorithm

作　　者：张敏[1] 方伟武[2] 张俊华[2] 迟忠先[1] 

机构地区：[1]大连理工大学计算机系 [2]中国科学院数学与系统科学研究院应用数学研究所,北京100080

出　　处：《计算机工程与应用》2005年第2期72-74,共3页Computer Engineering and Applications

基　　金：国家自然科学基金资助项目(编号:90103033)

摘　　要：该文提出一种新的迭代渐进多序列比对算法IPMSA。该算法先用渐进方法进行多序列比对,然后通过迭代策略,利用上一轮多序列比对结果修正指导树,产生新一轮比对。重复这一过程,直到指导树不再发生变化或满足事先设定的迭代次数为止。以比对数据库BAliBASE中多蛋白质家族1idy为例,对IPMSA算法和ClustalW算法进行的比较研究表明,该算法能更有效地比对分歧较大的序列,并改进其系统发育树。In this paper,a new iteratively progressive multiple sequence alignment algorithm IPMSA is developed.The al-gorithm is a integration of progressive alignment approach and iterative strategy.Firstly,it produces an alignment by pro-gressive alignment.Then,the guide tree is adjusted by using the result of the last multiple alignment.Next,a new multi-ple sequence alignment is produced by using the new guide tree.This process above is repeated until the guide tree is the same with the last one or some iterative number is fulfiled.Test result shows that IPMSA algorithm is more accura-cy than ClustalW in distance sequences.In addition,the phylogenetic tree can be improved.

关 键 词：多序列比对 渐进比对算法 迭代策略 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]