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