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 |
Sprog: | English |
Udgivet: |
2003
|
Lignende værker
-
Phylogenetic automata, pruning, and multiple alignment
af: Westesson, O, et al.
Udgivet: (2011) -
Bayesian phylogenetic inference under a statistical insertion-deletion model
af: Lunter, G, et al.
Udgivet: (2003) -
Polynomial algorithms for the Maximal Pairing Problem: efficient phylogenetic targeting on arbitrary trees
af: Stadler Peter F, et al.
Udgivet: (2010-06-01) -
An algorithm for statistical alignment of sequences related by a binary tree.
af: Hein, J
Udgivet: (2001) -
Genome-wide functional element detection using pairwise statistical alignment outperforms multiple genome footprinting techniques.
af: Satija, R, et al.
Udgivet: (2010)