An efficient algorithm for statistical multiple alignment on arbitrary phylogenetic trees.
We present an efficient algorithm for statistical multiple alignment based on the TKF91 model of Thorne, Kishino, and Felsenstein (1991) on an arbitrary k-leaved phylogenetic tree. The existing algorithms use a hidden Markov model approach, which requires at least O( radical 5(k)) states and leads t...
主要な著者: | Lunter, G, Miklós, I, Song, Y, Hein, J |
---|---|
フォーマット: | Journal article |
言語: | English |
出版事項: |
2003
|
類似資料
-
Phylogenetic automata, pruning, and multiple alignment
著者:: Westesson, O, 等
出版事項: (2011) -
Bayesian phylogenetic inference under a statistical insertion-deletion model
著者:: Lunter, G, 等
出版事項: (2003) -
Polynomial algorithms for the Maximal Pairing Problem: efficient phylogenetic targeting on arbitrary trees
著者:: Stadler Peter F, 等
出版事項: (2010-06-01) -
An algorithm for statistical alignment of sequences related by a binary tree.
著者:: Hein, J
出版事項: (2001) -
Genome-wide functional element detection using pairwise statistical alignment outperforms multiple genome footprinting techniques.
著者:: Satija, R, 等
出版事項: (2010)