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)