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...

Ausführliche Beschreibung

Bibliographische Detailangaben
Hauptverfasser: Westesson, O, Lunter, G, Paten, B, Holmes, I
Format: Internet publication
Sprache:English
Veröffentlicht: 2011

Ähnliche Einträge