Fast Statistical Alignment

PLOS COMPUTATIONAL BIOLOGY(2009)

引用 302|浏览71
暂无评分
摘要
We describe a new program for the alignment of multiple biological sequences that is both statistically motivated and fast enough for problem sizes that arise in practice. Our Fast Statistical Alignment program is based on pair hidden Markov models which approximate an insertion/deletion process on a tree and uses a sequence annealing algorithm to combine the posterior probabilities estimated from these models into a multiple alignment. FSA uses its explicit statistical model to produce multiple alignments which are accompanied by estimates of the alignment accuracy and uncertainty for every column and character of the alignment-previously available only with alignment programs which use computationally-expensive Markov Chain Monte Carlo approaches-yet can align thousands of long sequences. Moreover, FSA utilizes an unsupervised query-specific learning procedure for parameter estimation which leads to improved accuracy on benchmark reference alignments in comparison to existing programs. The centroid alignment approach taken by FSA, in combination with its learning procedure, drastically reduces the amount of false-positive alignment on biological data in comparison to that given by other methods. The FSA program and a companion visualization tool for exploring uncertainty in alignments can be used via a web interface at http://orangutan.math.berkeley.edu/fsa/, and the source code is available at http://fsa.sourceforge.net/.
更多
查看译文
关键词
artificial intelligence,monte carlo,posterior probability,multiple alignment,parameter estimation,sequence analysis,biological data,false positive,amino acid sequence,hidden markov model,source code,markov chains,statistical model,markov chain monte carlo,algorithms,web interface,sequence alignment
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要