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