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)