MBE Advance Access published online on December 23, 2003
Molecular Biology and Evolution, doi:10.1093/molbev/msh049
Molecular Biology and Evolution © Society for Molecular Biology and Evolution 2003; all rights reserved
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
1 National Center for Biotechnology Information, National Library of Medicine, National Institutes of Health, Building 38A, Room 6N611R, 8600 Rockville Pike, Bethesda, MD, USA
* To whom correspondence should be addressed. E-mail: gascuel{at}lirmm.fr.
Due to its speed, the distance approach remains the best hope for building phylogenies on very large sets of taxa. Recently (Desper and Gascuel 2002), we introduced a new "balanced" minimum evolution (BME) principle, based on a branch length estimation scheme of Pauplin (2000). Initial simulations suggested that FASTME, our program implementing the BME principle, was more accurate than or equivalent to all other distance methods we tested, with running time significantly faster than Neighbor-Joining (NJ). This article further explores the properties of the BME principle, and explains and illustrates its impressive topological accuracy. We prove that the BME principle is a special case of the weighted least-squares approach, with biologically meaningful variances of the distance estimates. We show that the BME principle is statistically consistent. We demonstrate that FASTME only produces trees with positive branch lengths, a feature that separates this approach from NJ (and related methods) that may produce trees with branches with biologically meaningless negative lengths. Finally, we consider a large simulated data set, with 5000 100-taxon trees generated by the Aldous beta-splitting distribution encompassing a range of distributions from Yule-Harding to uniform, and using a covarion-like model of sequence evolution. FASTME produces trees faster than NJ, and much faster than WEIGHBOR and the weighted least-squares implementation of PAUP*. Moreover, FASTME trees are consistently more accurate at all settings, ranging from Yule-Harding to uniform distributions, and all ranges of maximum pairwise divergence and departure from molecular clock. Interestingly, the covarion parameter has little effect on the tree quality for any of the algorithms. Key Words:
minimum evolution, least-squares, distance-based phylogenetic inference, consistency, method comparison using simulations
© 2003 Society for Molecular Biology and Evolution
Original Articles
Theoretical Foundation of the Balanced Minimum Evolution Method of Phylogenetic Inference and Its Relationship to Weighted Least-Squares Tree Fitting
2 Equipes Méthodes et Algorithmes pour la Bioinformatique LIRMM, 161 rue Ada, 34392 Montpellier, France
![]()
Abstract ![]()
CiteULike
Connotea
Del.icio.us What's this?
This article has been cited by other articles:
![]() |
K. Liu, S. Raghavan, S. Nelesen, C. R. Linder, and T. Warnow Rapid and Accurate Large-Scale Coestimation of Sequence Alignments and Phylogenetic Trees Science, June 19, 2009; 324(5934): 1561 - 1564. [Abstract] [Full Text] [PDF] |
||||
![]() |
H. C. Hartzell, K. Yu, Q. Xiao, L.-T. Chien, and Z. Qu Anoctamin/TMEM16 family members are Ca2+-activated Cl\#8722; channels J. Physiol., May 15, 2009; 587(10): 2127 - 2139. [Abstract] [Full Text] [PDF] |
||||
![]() |
K. Munch, W. Boomsma, E. Willerslev, and R. Nielsen Fast phylogenetic DNA barcoding Phil Trans R Soc B, December 27, 2008; 363(1512): 3997 - 4002. [Abstract] [Full Text] [PDF] |
||||
![]() |
M. T Holder, D. J Zwickl, and C. Dessimoz Evaluating the robustness of phylogenetic methods to among-site variability in substitution processes Phil Trans R Soc B, December 27, 2008; 363(1512): 4013 - 4021. [Abstract] [Full Text] [PDF] |
||||
![]() |
Combinatorics of least-squares trees PNAS, September 9, 2008; 105(36): 13206 - 13211. |
||||
![]() |
O. Gascuel and M. Steel Neighbor-Joining Revealed Mol. Biol. Evol., November 1, 2006; 23(11): 1997 - 2000. [Abstract] [Full Text] [PDF] |
||||
![]() |
M. Anisimova and O. Gascuel Approximate Likelihood-Ratio Test for Branches: A Fast, Accurate, and Powerful Alternative Syst Biol, August 1, 2006; 55(4): 539 - 552. [Abstract] [Full Text] [PDF] |
||||
![]() |
V. Hollich, L. Milchert, L. Arvestad, and E. L. L. Sonnhammer Assessment of Protein Distance Measures and Tree-Building Methods for Phylogenetic Tree Reconstruction Mol. Biol. Evol., November 1, 2005; 22(11): 2257 - 2264. [Abstract] [Full Text] [PDF] |
||||
![]() |
M. J. Buck and W. R. Atchley Networks of Coevolving Sites in Structural and Functional Domains of Serpin Proteins Mol. Biol. Evol., July 1, 2005; 22(7): 1627 - 1634. [Abstract] [Full Text] [PDF] |
||||
![]() |
R. Sanjuan and B. Wrobel Weighted Least-Squares Likelihood Ratio Test for Branch Testing in Phylogenies Reconstructed from Distance Measures Syst Biol, April 1, 2005; 54(2): 218 - 229. [Abstract] [Full Text] [PDF] |
||||
![]() |
K. Tamura, M. Nei, and S. Kumar Prospects for inferring very large phylogenies by using the neighbor-joining method PNAS, July 27, 2004; 101(30): 11030 - 11035. [Abstract] [Full Text] [PDF] |
||||





