@article {4259,
	title = {Probabilistic phylogenetic inference with insertions and deletions.},
	journal = {PLoS Computational Biology},
	volume = {4},
	year = {2008},
	month = {2008 Sep 19},
	pages = {e1000172},
	abstract = {<p>A fundamental task in sequence analysis is to calculate the probability of a multiple alignment given a phylogenetic tree relating the sequences and an evolutionary model describing how sequences change over time. However, the most widely used phylogenetic models only account for residue substitution events. We describe a probabilistic model of a multiple sequence alignment that accounts for insertion and deletion events in addition to substitutions, given a phylogenetic tree, using a rate matrix augmented by the gap character. Starting from a continuous Markov process, we construct a non-reversible generative (birth-death) evolutionary model for insertions and deletions. The model assumes that insertion and deletion events occur one residue at a time. We apply this model to phylogenetic tree inference by extending the program dnaml in phylip. Using standard benchmarking methods on simulated data and a new "concordance test" benchmark on real ribosomal RNA alignments, we show that the extended program dnamlepsilon improves accuracy relative to the usual approach of ignoring gaps, while retaining the computational efficiency of the Felsenstein peeling algorithm.</p>
},
	keywords = {Algorithms, Computational Biology, Computer Simulation, DNA, Evolution, Genetic, Insertional, Markov Chains, Models, Molecular, Mutagenesis, Phylogeny, Poisson Distribution, Ribosomal, RNA, Sequence Alignment, Sequence Deletion, Software, Statistical},
	issn = {1553-7358},
	doi = {10.1371/journal.pcbi.1000172},
	author = {Rivas, Elena and Sean R. Eddy}
}
