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)