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)