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...
Главные авторы: | Lunter, G, Miklós, I, Song, Y, Hein, J |
---|---|
Формат: | Journal article |
Язык: | English |
Опубликовано: |
2003
|
Схожие документы
-
Phylogenetic automata, pruning, and multiple alignment
по: Westesson, O, и др.
Опубликовано: (2011) -
Bayesian phylogenetic inference under a statistical insertion-deletion model
по: Lunter, G, и др.
Опубликовано: (2003) -
Polynomial algorithms for the Maximal Pairing Problem: efficient phylogenetic targeting on arbitrary trees
по: Stadler Peter F, и др.
Опубликовано: (2010-06-01) -
An algorithm for statistical alignment of sequences related by a binary tree.
по: Hein, J
Опубликовано: (2001) -
Genome-wide functional element detection using pairwise statistical alignment outperforms multiple genome footprinting techniques.
по: Satija, R, и др.
Опубликовано: (2010)