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...
Main Authors: | Lunter, G, Miklós, I, Song, Y, Hein, J |
---|---|
פורמט: | Journal article |
שפה: | English |
יצא לאור: |
2003
|
פריטים דומים
-
Phylogenetic automata, pruning, and multiple alignment
מאת: Westesson, O, et al.
יצא לאור: (2011) -
Bayesian phylogenetic inference under a statistical insertion-deletion model
מאת: Lunter, G, et al.
יצא לאור: (2003) -
Polynomial algorithms for the Maximal Pairing Problem: efficient phylogenetic targeting on arbitrary trees
מאת: Stadler Peter F, et al.
יצא לאור: (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, et al.
יצא לאור: (2010)