Edgar Robert C
Nucleic Acids Res. 2004 Mar 19;32(5):1792-7. doi: 10.1093/nar/gkh340. Print 2004.
We describe MUSCLE, a new computer program for creating multiple alignments of protein sequences. Elements of the algorithm include fast distance estimation using kmer counting, progressive alignment using a new profile function we call the log-expectation score, and refinement using tree-dependent restricted partitioning. The speed and accuracy of MUSCLE are compared with T-Coffee, MAFFT and CLUSTALW on four test sets of reference alignments: BAliBASE, SABmark, SMART and a new benchmark, PREFAB. MUSCLE achieves the highest, or joint highest, rank in accuracy on each of these sets. Without refinement, MUSCLE achieves average accuracy statistically indistinguishable from T-Coffee and MAFFT, and is the fastest of the tested methods for large numbers of sequences, aligning 5000 sequences of average length 350 in 7 min on a current desktop computer. The MUSCLE program, source code and PREFAB test data are freely available at http://www.drive5. com/muscle.
我们介绍了MUSCLE,一个用于创建蛋白质序列多重比对的新计算机程序。该算法的要素包括使用kmer计数进行快速距离估计、使用一种我们称为对数期望分数的新轮廓函数进行渐进比对,以及使用依赖树的受限划分进行优化。在四个参考比对测试集(BAliBASE、SABmark、SMART和一个新的基准测试集PREFAB)上,将MUSCLE的速度和准确性与T-Coffee、MAFFT和CLUSTALW进行了比较。MUSCLE在这些测试集中的每一个上都取得了最高或并列最高的准确性排名。在没有优化的情况下,MUSCLE达到的平均准确性在统计学上与T-Coffee和MAFFT没有区别,并且是测试方法中处理大量序列最快的,在当前台式计算机上7分钟内可比对5000个平均长度为350的序列。MUSCLE程序、源代码和PREFAB测试数据可从http://www.drive5.com/muscle免费获取。