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... (read more)

Results in Papers With Code
(↓ scroll down to see all results)