.png){kind=icon}
返回
An algorithm for progressive multiple alignment of sequences with insertions
.png){kind=icon}
OA
AI
DOI：10.1073/pnas.0409137102.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Dynamic programming algorithms guarantee to find the optimal alignment between two sequences. For more than a few sequences, exact algorithms become computationally impractical, and progressive algorithms iterating pairwise alignments are widely used. These heuristic methods have a serious drawback because pairwise algorithms do not differentiate insertions from deletions and end up penalizing single insertion events multiple times. Such an unrealistically high penalty for insertions typically results in overmatching of sequences and an underestimation of the number of insertion events. We describe a modification of the traditional alignment algorithm that can distinguish insertion from deletion and avoid repeated penalization of insertions and illustrate this method with a pair hidden Markov model that uses an evolutionary scoring function. In comparison with a traditional progressive alignment method, our algorithm infers a greater number of insertion events and creates gaps that are phylogenetically consistent but spatially less concentrated. Our results suggest that some insertion/deletion hot spots may actually be artifacts of traditional alignment algorithms.
Keyword:
insertion/deletion
progressive algorithm
sequence alignment
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
P
IF:
9.1
论文数:
10.8W
被引数:
73.5W
机构
暂无机构信息
引用论文
分享收藏Hybrid genomes of the polyomaviruses JC virus, BK virus, and simian virus 40: identification of sequences important for efficient transformation多体病毒JC病毒，BK病毒和猿猴病毒40的杂交基因组: 鉴定对有效转化至关重要的序列
OAAI
OAAI分享收藏分享收藏Molecular phylogenetics:: state-of-the-art methods for looking into the past.png)
TRENDS IN GENETICS
TRENDS IN GENETICSIF16.3
PREAI
分享收藏
查看更多内容