摘要
在分析和证明了构建进化树的Neighbor-joining算法存在的不足后,提出了一种新的改进算法。算法主要有以下两点改进采用Kimura两参数模型,根据此模型来计算DNA序列距离,并且定义了新的校正距离。计算机模拟结果表明,改进算法的效率明显地优于NJ算法。
After analyzing and proving the defects of Neighbor -joining Method,which is an important method for reconstructing phylogenetic trees,the writers present an improved algorithm.It has the following two major improvement :the first is adopting new definition of the distance among the DNA arrays,which utilizes Kimura two parameter model and calculate DNA array distance according to this model,then the second is defining the new rate-corrected distance.Using computer simulation,we study the efficiency of this method in obtaining the correct unrooted trees,and find that it is much better than that of NJ method.
出处
《计算机工程与应用》
CSCD
北大核心
2004年第21期84-85,97,共3页
Computer Engineering and Applications
