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...
Auteurs principaux: | Lunter, G, Miklós, I, Song, Y, Hein, J |
---|---|
Format: | Journal article |
Langue: | English |
Publié: |
2003
|
Documents similaires
-
Phylogenetic automata, pruning, and multiple alignment
par: Westesson, O, et autres
Publié: (2011) -
Bayesian phylogenetic inference under a statistical insertion-deletion model
par: Lunter, G, et autres
Publié: (2003) -
Polynomial algorithms for the Maximal Pairing Problem: efficient phylogenetic targeting on arbitrary trees
par: Stadler Peter F, et autres
Publié: (2010-06-01) -
An algorithm for statistical alignment of sequences related by a binary tree.
par: Hein, J
Publié: (2001) -
Genome-wide functional element detection using pairwise statistical alignment outperforms multiple genome footprinting techniques.
par: Satija, R, et autres
Publié: (2010)