A "Long Indel" model for evolutionary sequence alignment.
We present a new probabilistic model of sequence evolution, allowing indels of arbitrary length, and give sequence alignment algorithms for our model. Previously implemented evolutionary models have allowed (at most) single-residue indels or have introduced artifacts such as the existence of indivisible "fragments." We compare our algorithm to these previous methods by applying it to the structural homology dataset HOMSTRAD, evaluating the accuracy of (1) alignments and (2) evolutionary time estimates. With our method, it is possible (for the first time) to integrate probabilistic sequence alignment, with reliability indicators and arbitrary gap penalties, in the same framework as phylogenetic reconstruction. Our alignment algorithm requires that we evaluate the likelihood of any specific path of mutation events in a continuous-time Markov model, with the event times integrated out. To this effect, we introduce a "trajectory likelihood" algorithm (Appendix A). We anticipate that this algorithm will be useful in more general contexts, such as Markov Chain Monte Carlo simulations.
Miklós
I
I
Department of Statistics, University of Oxford, Oxford, UK. miklos@stats.ox.ac.uk
Lunter
G A
GA
Holmes
I
I
D000465:Algorithms; D019143:Evolution, Molecular; D016013:Likelihood Functions; D008390:Markov Chains; D016415:Sequence Alignment / Q000379:methods*