Very fast algorithms for evaluating the stability of ML and Bayesian phylogenetic trees from sequence data. Export

@article{waddell02, abstract = {Evolutionary trees sit at the core of all realistic models describing a set of related sequences, including alignment, homology search, ancestral protein reconstruction and 2D/3D structural change. It is important to assess the stochastic error when estimating a tree, including models using the most realistic likelihood-based optimizations, yet computation times may be many days or weeks. If so, the bootstrap is computationally prohibitive. Here we show that the extremely fast "resampling of estimated log likelihoods" or RELL method behaves well under more general circumstances than previously examined. RELL approximates the bootstrap (BP) proportions of trees better that some bootstrap methods that rely on fast heuristics to search the tree space. The BIC approximation of the Bayesian posterior probability (BPP) of trees is made more accurate by including an additional term related to the determinant of the information matrix (which may also be obtained as a product of gradient or score vectors). Such estimates are shown to be very close to MCMC chain values. Our analysis of mammalian mitochondrial amino acid sequences suggest that when model breakdown occurs, as it typically does for sequences separated by more than a few million years, the BPP values are far too peaked and the real fluctuations in the likelihood of the data are many times larger than expected. Accordingly, several ways to incorporate the bootstrap and other types of direct resampling with MCMC procedures are outlined. Genes evolve by a process which involves some sites following a tree close to, but not identical with, the species tree. It is seen that under such a likelihood model BP (bootstrap proportions) and BPP estimates may still be reasonable estimates of the species tree. Since many of the methods studied are very fast computationally, there is no reason to ignore stochastic error even with the slowest ML or likelihood based methods.}, address = {Department of Statistics and Department of Biological Sciences, University of South Carolina, Columbia, SC 29208, USA. waddell@stat.sc.edu}, author = {Waddell, P. J. and Kishino, H. and Ota, R.}, citeulike-article-id = {2247771}, citeulike-linkout-0 = {http://view.ncbi.nlm.nih.gov/pubmed/14571377}, citeulike-linkout-1 = {http://www.hubmed.org/display.cgi?uids=14571377}, citeulike-linkout-2 = {http://view.ncbi.nlm.nih.gov/pubmed/14571377}, issn = {0919-9454}, journal = {Genome Inform}, keywords = {bayesian, bootstrap, consensus, methods, phylogenetics}, pages = {82--92}, posted-at = {2008-01-17 22:48:55}, priority = {2}, title = {Very fast algorithms for evaluating the stability of ML and Bayesian phylogenetic trees from sequence data.}, url = {http://view.ncbi.nlm.nih.gov/pubmed/14571377}, volume = {13}, year = {2002} }

TY - JOUR ID - waddell02 L3 - citeulike-article-id:2247771 N2 - Evolutionary trees sit at the core of all realistic models describing a set of related sequences, including alignment, homology search, ancestral protein reconstruction and 2D/3D structural change. It is important to assess the stochastic error when estimating a tree, including models using the most realistic likelihood-based optimizations, yet computation times may be many days or weeks. If so, the bootstrap is computationally prohibitive. Here we show that the extremely fast "resampling of estimated log likelihoods" or RELL method behaves well under more general circumstances than previously examined. RELL approximates the bootstrap (BP) proportions of trees better that some bootstrap methods that rely on fast heuristics to search the tree space. The BIC approximation of the Bayesian posterior probability (BPP) of trees is made more accurate by including an additional term related to the determinant of the information matrix (which may also be obtained as a product of gradient or score vectors). Such estimates are shown to be very close to MCMC chain values. Our analysis of mammalian mitochondrial amino acid sequences suggest that when model breakdown occurs, as it typically does for sequences separated by more than a few million years, the BPP values are far too peaked and the real fluctuations in the likelihood of the data are many times larger than expected. Accordingly, several ways to incorporate the bootstrap and other types of direct resampling with MCMC procedures are outlined. Genes evolve by a process which involves some sites following a tree close to, but not identical with, the species tree. It is seen that under such a likelihood model BP (bootstrap proportions) and BPP estimates may still be reasonable estimates of the species tree. Since many of the methods studied are very fast computationally, there is no reason to ignore stochastic error even with the slowest ML or likelihood based methods. JF - Genome Inform SN - 0919-9454 AD - Department of Statistics and Department of Biological Sciences, University of South Carolina, Columbia, SC 29208, USA. waddell@stat.sc.edu EP - 92 TI - Very fast algorithms for evaluating the stability of ML and Bayesian phylogenetic trees from sequence data. VL - 13 SP - 82 KW - bayesian KW - bootstrap KW - consensus KW - methods KW - phylogenetics AU - Waddell, PJ AU - Kishino, H AU - Ota, R PY - 2002/// UR - http://view.ncbi.nlm.nih.gov/pubmed/14571377 ER -