Phylogenetic automata, pruning, and multiple alignment
We present an extension of Felsenstein's algorithm to indel models defined on entire sequences, without the need to condition on one multiple alignment. The algorithm makes use of a generalization from probabilistic substitution matrices to weighted finite-state transducers. Our approach may eq...
المؤلفون الرئيسيون: | Westesson, O, Lunter, G, Paten, B, Holmes, I |
---|---|
التنسيق: | Internet publication |
اللغة: | English |
منشور في: |
2011
|
مواد مشابهة
-
Accurate reconstruction of insertion-deletion histories by statistical phylogenetics.
حسب: Westesson, O, وآخرون
منشور في: (2012) -
Accurate reconstruction of insertion-deletion histories by statistical phylogenetics.
حسب: Oscar Westesson, وآخرون
منشور في: (2012-01-01) -
Meta-Alignment with Crumble and Prune: Partitioning very large alignment problems for performance and parallelization
حسب: Paten Benedict, وآخرون
منشور في: (2011-05-01) -
An efficient algorithm for statistical multiple alignment on arbitrary phylogenetic trees.
حسب: Lunter, G, وآخرون
منشور في: (2003) -
Accurate detection of recombinant breakpoints in whole-genome alignments.
حسب: Oscar Westesson, وآخرون
منشور في: (2009-03-01)