Sammeth Michael, Morgenstern Burkhard, Stoye Jens
Bielefeld University, Department of Genome Informatics, Technical Faculty, Bielefeld, Germany.
Bioinformatics. 2003 Oct;19 Suppl 2:ii189-95. doi: 10.1093/bioinformatics/btg1077.
A large number of methods for multiple sequence alignment are currently available. Recent benchmarking tests demonstrated that strengths and drawbacks of these methods differ substantially. Global strategies can be outperformed by approaches based on local similarities and vice versa, depending on the characteristics of the input sequences. In recent years, mixed approaches that include both global and local features have shown promising results. Herein, we introduce a new algorithm for multiple sequence alignment that integrates the global divide-and-conquer approach with the local segment-based approach, thereby combining the strengths of those two strategies.
目前有大量用于多序列比对的方法。最近的基准测试表明，这些方法的优缺点存在很大差异。根据输入序列的特征，基于局部相似性的方法可能会优于全局策略，反之亦然。近年来，包含全局和局部特征的混合方法已显示出有前景的结果。在此，我们介绍一种新的多序列比对算法，该算法将全局分治法与基于局部片段的方法相结合，从而结合了这两种策略的优势。
