FastTree 2-Approximately Maximum-Likelihood Trees for Large Alignments

被引:9676
作者
Price, Morgan N. [1 ,2 ]
Dehal, Paramvir S. [1 ,2 ]
Arkin, Adam P. [1 ,2 ,3 ]
机构
[1] Univ Calif Berkeley, Lawrence Berkeley Lab, Phys Biosci Div, Berkeley, CA 94720 USA
[2] Univ Calif Berkeley, Lawrence Berkeley Lab, Virtual Inst Microbial Stress & Survival, Berkeley, CA 94720 USA
[3] Univ Calif Berkeley, Dept Bioengn, Berkeley, CA 94720 USA
来源
PLOS ONE | 2010年 / 5卷 / 03期
关键词
DNA-SEQUENCES; ALGORITHM; PHYLOGENIES; ACCURATE; RECONSTRUCTION; CONFIDENCE; PRINCIPLE; DATABASE; NUMBER; MOVES;
D O I
10.1371/journal.pone.0009490
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Background: We recently described FastTree, a tool for inferring phylogenies for alignments with up to hundreds of thousands of sequences. Here, we describe improvements to FastTree that improve its accuracy without sacrificing scalability. Methodology/Principal Findings: Where FastTree 1 used nearest-neighbor interchanges (NNIs) and the minimum-evolution criterion to improve the tree, FastTree 2 adds minimum-evolution subtree-pruning-regrafting (SPRs) and maximum-likelihood NNIs. FastTree 2 uses heuristics to restrict the search for better trees and estimates a rate of evolution for each site (the "CAT" approximation). Nevertheless, for both simulated and genuine alignments, FastTree 2 is slightly more accurate than a standard implementation of maximum-likelihood NNIs (PhyML 3 with default settings). Although FastTree 2 is not quite as accurate as methods that use maximum-likelihood SPRs, most of the splits that disagree are poorly supported, and for large alignments, FastTree 2 is 100-1,000 times faster. FastTree 2 inferred a topology and likelihood-based local support values for 237,882 distinct 16S ribosomal RNAs on a desktop computer in 22 hours and 5.8 gigabytes of memory. Conclusions/Significance: FastTree 2 allows the inference of maximum-likelihood phylogenies for huge alignments. FastTree 2 is freely available at http://www.microbesonline.org/fasttree.
引用
收藏
页数:10
相关论文
共 34 条
[1]   Approximate likelihood-ratio test for branches: A fast, accurate, and powerful alternative [J].
Anisimova, Maria ;
Gascuel, Olivier .
SYSTEMATIC BIOLOGY, 2006, 55 (04) :539-552
[2]   Consistency of Topological Moves Based on the Balanced Minimum Evolution Principle of Phylogenetic Inference [J].
Bordewich, Magnus ;
Gascuel, Olivier ;
Huber, Katharina T. ;
Moulton, Vincent .
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2009, 6 (01) :110-117
[3]  
Bradley R., 2009, PLoS Computational Biology, V5
[4]   COMPARING THE AREAS UNDER 2 OR MORE CORRELATED RECEIVER OPERATING CHARACTERISTIC CURVES - A NONPARAMETRIC APPROACH [J].
DELONG, ER ;
DELONG, DM ;
CLARKEPEARSON, DI .
BIOMETRICS, 1988, 44 (03) :837-845
[5]   Greengenes, a chimera-checked 16S rRNA gene database and workbench compatible with ARB [J].
DeSantis, T. Z. ;
Hugenholtz, P. ;
Larsen, N. ;
Rojas, M. ;
Brodie, E. L. ;
Keller, K. ;
Huber, T. ;
Dalevi, D. ;
Hu, P. ;
Andersen, G. L. .
APPLIED AND ENVIRONMENTAL MICROBIOLOGY, 2006, 72 (07) :5069-5072
[6]   Theoretical foundation of the balanced minimum evolution method of phylogenetic inference and its relationship to weighted least-squares tree fitting [J].
Desper, R ;
Gascuel, O .
MOLECULAR BIOLOGY AND EVOLUTION, 2004, 21 (03) :587-598
[7]   Fast and accurate phylogeny reconstruction algorithms based on the minimum-evolution principle [J].
Desper, R ;
Gascuel, O .
JOURNAL OF COMPUTATIONAL BIOLOGY, 2002, 9 (05) :687-705
[8]   Relaxed neighbor joining: A fast distance-based phylogenetic tree construction method [J].
Evans, J ;
Sheneman, L ;
Foster, J .
JOURNAL OF MOLECULAR EVOLUTION, 2006, 62 (06) :785-792
[9]   EVOLUTIONARY TREES FROM DNA-SEQUENCES - A MAXIMUM-LIKELIHOOD APPROACH [J].
FELSENSTEIN, J .
JOURNAL OF MOLECULAR EVOLUTION, 1981, 17 (06) :368-376
[10]  
FELSENSTEIN J, 1985, EVOLUTION, V39, P783, DOI 10.1111/j.1558-5646.1985.tb00420.x