MSARC:通过残基聚类的多个序列比对
MSARC: Multiple Sequence Alignment by Residue Clustering
摘要:
渐进式方法为多序列比对问题提供了有效且合理的解决方案。然而,所得到的比对是有偏见的指导树,特别是对于相对遥远的序列。我们提出了MSARC,一个新的基于图聚类的算法,对齐序列集没有指导树。在BAliBASE数据集上的实验表明,MSARC实现了与最佳渐进方法相似的对齐质量,并且比其他非渐进算法的质量高得多。此外,MSARC优于所有其他方法的序列集的相似性结构很难表示的系统发育树。此外,MSARC优于所有其他方法的序列集的进化距离很难表示的系统发育树。这些数据集最容易受到路线导向树偏差的影响。MSARC可在http://bioputer.mimuw.edu.pl/msarc上获得
英文摘要:
Progressive methods offer efficient and reasonably good solutions to the multiple sequence alignment problem. However, resulting alignments are biased by guide-trees, especially for relatively distant sequences. We propose MSARC, a new graph-clustering based algorithm that aligns sequence sets without guide-trees. Experiments on the BAliBASE dataset show that MSARC achieves alignment quality similar to best progressive methods and substantially higher than the quality of other non-progressive algorithms. Furthermore, MSARC outperforms all other methods on sequence sets with the similarity structure hardly represented by a phylogenetic tree. Furthermore, MSARC outperforms all other methods on sequence sets whose evolutionary distances are hardly representable by a phylogenetic tree. These datasets are most exposed to the guide-tree bias of alignments. MSARC is available at http://bioputer.mimuw.edu.pl/msarc
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。