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)