Abstract
Much modern work in phylogenetics depends on statistical sampling approaches to phylogeny construction to estimate probability distributions of possible trees for any given input data set. Our theoretical understanding of sampling approaches to phylogenetics remains far less developed than that for optimization approaches, however, particularly with regard to the number of sampling steps needed to produce accurate samples of tree partition functions. Despite the many advantages in principle of being able to sample trees from sophisticated probabilistic models, we have little theoretical basis for concluding that the prevailing sampling approaches do in fact yield accurate samples from those models within realistic numbers of steps. We propose a novel approach to phylogenetic sampling intended to be both efficient in practice and more amenable to theoretical analysis than the prevailing methods. The method depends on replacing the standard tree rearrangement moves with an alternative Markov model in which one solves a theoretically hard but practically tractable optimization problem on each step of sampling. The resulting method can be applied to a broad range of standard probability models, yielding practical algorithms for efficient sampling and rigorous proofs of accurate sampling for some important special cases. We demonstrate the efficiency and versatility of the method in an analysis of uncertainty in tree inference over varying input sizes. In addition to providing a new practical method for phylogenetic sampling, the technique is likely to prove applicable to many similar problems involving sampling over combinatorial objects weighted by a likelihood model.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Huelsenbeck, J.P., Ronquist, F.: MRBAYES: Bayesian inference of phylogeny. Bioinformatics 17, 754–755 (2001)
Felsenstein, J.: Inferring Phylogenies. Sinauer Publications (2004)
Diaconis, P., Holmes, S.P.: Random walks on trees and matchings. Electronic Journal of Probability 7(6) (2002)
Stefankovic, D., Vigoda, E.: Fast Convergence of MCMC Algorithms for Phy- logenetic Reconstruction with Homogeneous Data on Closely Related Species arXiv:1003.5964 (2010)
Mossel, E., Vigoda, E.: Phylogenetic MCMC algorithms are misleading on mixtures of trees. Science 309(5744), 2207–2209 (2005)
Stefankovic, D., Vigoda, E.: Pitfalls of heterogeneous processes for phylogenetic reconstruction. Systematic Biology 56(1), 113–124 (2007)
Cavender, J.A.: Taxonomy with confidence. Mathematical Biosciences 40, 271–280 (1978)
Farris, J.S.: A probability model for inferring evolutionary trees. Systematic Zoology 22, 250–256 (1973)
Neyman, J.: Molecular studies of evolution: a source of novel statistical problems. In: Gupta, S.S., Yackel, J. (eds.) Statistical Decision Theory and Related Topics, pp. 1–27 (1971)
Misra, N., Schwartz, R.: Efficient stochastic sampling of first-passage time with applications to self-assembly simulation. Journal of Chemical Physics 129, 204109 (2008)
Bubley, R., Dyer, M.: Path coupling: A technique for proving rapid mixing in Markov chains. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pp. 223–231 (1997)
Rokas, A., Carroll, S.B.: Bushes in the Tree of Life. PLoS Biol. 4(11), e352 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Misra, N., Blelloch, G., Ravi, R., Schwartz, R. (2011). An Optimization-Based Sampling Scheme for Phylogenetic Trees. In: Bafna, V., Sahinalp, S.C. (eds) Research in Computational Molecular Biology. RECOMB 2011. Lecture Notes in Computer Science(), vol 6577. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20036-6_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-20036-6_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20035-9
Online ISBN: 978-3-642-20036-6
eBook Packages: Computer ScienceComputer Science (R0)