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...
Những tác giả chính: | Lunter, G, Miklós, I, Song, Y, Hein, J |
---|---|
Định dạng: | Journal article |
Ngôn ngữ: | English |
Được phát hành: |
2003
|
Những quyển sách tương tự
-
Phylogenetic automata, pruning, and multiple alignment
Bằng: Westesson, O, et al.
Được phát hành: (2011) -
Bayesian phylogenetic inference under a statistical insertion-deletion model
Bằng: Lunter, G, et al.
Được phát hành: (2003) -
Polynomial algorithms for the Maximal Pairing Problem: efficient phylogenetic targeting on arbitrary trees
Bằng: Stadler Peter F, et al.
Được phát hành: (2010-06-01) -
An algorithm for statistical alignment of sequences related by a binary tree.
Bằng: Hein, J
Được phát hành: (2001) -
Genome-wide functional element detection using pairwise statistical alignment outperforms multiple genome footprinting techniques.
Bằng: Satija, R, et al.
Được phát hành: (2010)