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...
Asıl Yazarlar: | Lunter, G, Miklós, I, Song, Y, Hein, J |
---|---|
Materyal Türü: | Journal article |
Dil: | English |
Baskı/Yayın Bilgisi: |
2003
|
Benzer Materyaller
-
Phylogenetic automata, pruning, and multiple alignment
Yazar:: Westesson, O, ve diğerleri
Baskı/Yayın Bilgisi: (2011) -
Bayesian phylogenetic inference under a statistical insertion-deletion model
Yazar:: Lunter, G, ve diğerleri
Baskı/Yayın Bilgisi: (2003) -
Polynomial algorithms for the Maximal Pairing Problem: efficient phylogenetic targeting on arbitrary trees
Yazar:: Stadler Peter F, ve diğerleri
Baskı/Yayın Bilgisi: (2010-06-01) -
An algorithm for statistical alignment of sequences related by a binary tree.
Yazar:: Hein, J
Baskı/Yayın Bilgisi: (2001) -
Genome-wide functional element detection using pairwise statistical alignment outperforms multiple genome footprinting techniques.
Yazar:: Satija, R, ve diğerleri
Baskı/Yayın Bilgisi: (2010)