返回
A comprehensive comparison of multiple sequence alignment programs
DOI:10.1093/nar/27.13.2682.png)
摘要
En 中文
In recent years improvements to existing programs and the introduction of new iterative algorithms have changed the state-of-the-art in protein sequence alignment. This paper presents the first systematic study of the most commonly used alignment programs using BAliBASE benchmark alignments as test cases, Even below the 'twilight zone' at 10-20% residue identity, the best programs were capable of correctly aligning on average 47% of the residues. We show that iterative algorithms often offer improved alignment accuracy though at the expense of computation time, A notable exception was the effect of introducing a single divergent sequence into a set of closely related sequences, causing the iteration to diverge away from the best alignment. Global alignment programs generally performed better than local methods, except in the presence of large N/C-terminal extensions and internal insertions. In these cases, a local algorithm was more successful in identifying the most conserved motifs, This study enables us to propose appropriate alignment strategies, depending on the nature of a particular set of sequences. The employment of more than one program based on different alignment techniques should significantly improve the quality of automatic protein sequence alignment methods. The results also indicate guidelines for improvement of alignment algorithms.
Keyword:
PHYLOGENETIC TREES
GAP PENALTIES
SEARCH
ALGORITHM
PROTEINS
TOOLS
DNA
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.1
论文数:
3.6W
被引数:
29.0W
机构
暂无机构信息
引用论文
The CLUSTAL_X windows interface: flexible strategies for multiple sequence alignment aided by quality analysis toolsCLUSTAL_X windows界面: 通过质量分析工具辅助的多序列比对的灵活策略
NUCLEIC ACIDS RESEARCH
IF13.1

