Phylogenetic MCMC algorithms are misleading on mixtures of trees.

  title={Phylogenetic MCMC algorithms are misleading on mixtures of trees.},
  author={Elchanan Mossel and Eric Vigoda},
  volume={309 5744},
Markov chain Monte Carlo (MCMC) algorithms play a critical role in the Bayesian approach to phylogenetic inference. We present a theoretical analysis of the rate of convergence of many of the widely used Markov chains. For N characters generated from a uniform mixture of two trees, we prove that the Markov chains take an exponentially long (in N) number of iterations to converge to the posterior distribution. Nevertheless, the likelihood plots for sample runs of the Markov chains deceivingly… CONTINUE READING


Publications citing this paper.
Showing 1-10 of 87 extracted citations


Publications referenced by this paper.
Showing 1-10 of 15 references

RECOMB 2006, in press; available atÈcostis/papers/distpaper.pdf

  • C. Daskalakis
  • 2006

Vigoda, available at Èvigoda

  • E. D. Stefankovic
  • 2006

Complexity of the simplest phylogenetic estimation problem

  • Z. Yang
  • Bayesian analysis in molecular biology and…
  • 2004

Rannala , Bayesian Phylogenetic Inference Using DNA Sequences : A Markov Chain Monte Carlo Method

  • Z. Yang, B.
  • Proc . R . Soc . Lond . B Biol . Sci .
  • 2000

Similar Papers

Loading similar papers…