Markov chain Monte Carlo algorithms for the Bayesian analysis of phylogenetic trees

Citation
B. Larget et Dl. Simon, Markov chain Monte Carlo algorithms for the Bayesian analysis of phylogenetic trees, MOL BIOL EV, 16(6), 1999, pp. 750-759
Citations number
37
Categorie Soggetti
Biology,"Experimental Biology
Journal title
MOLECULAR BIOLOGY AND EVOLUTION
ISSN journal
07374038 → ACNP
Volume
16
Issue
6
Year of publication
1999
Pages
750 - 759
Database
ISI
SICI code
0737-4038(199906)16:6<750:MCMCAF>2.0.ZU;2-Y
Abstract
We further develop the Bayesian framework for analyzing aligned nucleotide sequence data to reconstruct phylogenies, assess uncertainty in the reconst ructions, and perform other statistical inferences. We employ a Markov chai n Monte Carlo sampler to sample trees and model parameter values from their joint posterior distribution. All statistical inferences are naturally bas ed on this sample. The sample provides a most-probable tree with posterior probabilities for each clade, information that is qualitatively similar to that for the maximum-likelihood tree with bootstrap proportions and permits further inferences on tree topology, branch lengths, and model parameter v alues. On moderately large trees, the computational advantage of our method over bootstrapping a maximum-likelihood analysis can be considerable. In a n example with 31 taxa, the time expended by our software is orders of magn itude less than that a widely used phylogeny package for bootstrapping maxi mum likelihood estimation would require to achieve comparable statistical a ccuracy. While there has been substantial debate over the proper interpreta tion of bootstrap proportions, Bayesian posterior probabilities clearly and directly quantify uncertainty in questions of biological interest, at leas t from a Bayesian perspective. Because our tree proposal algorithms are ind ependent of the choice of likelihood function, they could also be used in c onjunction with likelihood models more complex than those we have currently implemented.