RAxML and FastTree: Comparing two methods for large-scale maximum likelihood phylogeny estimation

PLoS ONE

Volumn 6, Issue 11, 2011, Pages

  Liu, Kevin ^a   Linder, C Randal ^b   Warnow, Tandy ^a  

^a University of Texas at Austin   (United States)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYTIC METHOD; ARTICLE; BOOTSTRAPPING; CONTROLLED STUDY; FASTTREE METHOD; GENETIC DATABASE; GENETIC VARIABILITY; INTERMETHOD COMPARISON; MATHEMATICAL ANALYSIS; MAXIMUM LIKELIHOOD METHOD; NUCLEOTIDE SEQUENCE; PHYLOGENETIC TREE; PHYLOGENY; PROCESS DEVELOPMENT; RAXML METHOD; SEQUENCE ALIGNMENT; SIMULATION; BIOLOGY; COMPARATIVE STUDY; COMPUTER PROGRAM; COMPUTER SIMULATION; HUMAN; METHODOLOGY; STATISTICAL MODEL;

BASE SEQUENCE; COMPUTATIONAL BIOLOGY; COMPUTER SIMULATION; DATABASES, GENETIC; HUMANS; LIKELIHOOD FUNCTIONS; PHYLOGENY; SEQUENCE ALIGNMENT; SOFTWARE;

EID: 81455140612     PISSN: None     EISSN: 19326203     Source Type: Journal    
DOI: 10.1371/journal.pone.0027731     Document Type: Article

References (19)

1. Huelsenbeck J, Ronquist R, (2001) MrBayes: Bayesian inference of phylogeny. Bioinf 17: 754-755.
2. Stamatakis A, (2006) RAxML-VI-HPC: maximum likelihood-based phylogenetic analyses with thousands of taxa and mixed models. Bioinf 22: 2688-2690.
3. Stamatakis A, Hoover P, Rougemont J, (2008) A rapid bootstrap algorithm for the RAxML web servers. Syst Biol 57: 758-771.
4. Zwickl D, (2006) Genetic algorithm approaches for the phylogenetic analysis of large biological sequence datasets under the maximum likelihood criterion. Ph.D. thesis, The University of Texas at Austin.
5. Guindon S, Gascuel O, (2003) A simple, fast, and accurate algorithm to estimate large phylogenies by maximum likelihood. Syst Biol 52: 696-704.
6. Swofford DL, (2003) PAUP*: Phylogenetic analysis using parsimony (*and other methods), version 4. Sinauer Associates.
7. Liu K, Linder CR, Warnow T, (2010) Multiple sequence alignment: a major challenge to large-scale phylogenetics. PLoS Currents: Tree of Life 2: RRN1198.
8. Liu K, Raghavan S, Nelesen S, Linder CR, Warnow T, (2009) Rapid and accurate large-scale coestimation of sequence alignments and phylogenetic trees. Science 324: 1561-1564.
9. Liu K, Warnow T, Holder MT, Nelesen S, Yu J, et al. (In press) SAT'e-II: Very fast and accurate simultaneous estimation of multiple sequence alignments and phylogenetic trees. Syst Biol.
10. Price M, Dehal P, Arkin A, (2009) FastTree: Computing large minimum evolution trees with profiles instead of a distance matrix. Mol Biol Evol 26: 1641-1650.
11. Price M, Dehal P, Arkin A, (2010) FastTree 2- approximately maximum-likelihood trees for large alignments. PLoS ONE 5: e9490.
12. Stoye J, Evers D, Meyer F, (1998) ROSE: generating sequence families. Bioinf 14: 157-163.
13. Benjamini Y, Hochberg Y, (1995) Controlling the false discovery rate: A practical and powerful approach to multiple testing. J Royal Stat Soc Series B (Method) 57: 289-300.
14. Cannone J, Subramanian S, Schnare M, Collett J, D'Souza L, et al. (2002) The Comparative RNA Web (CRW) Site: An Online Database of Comparative Sequence and Structure Information for Ribosomal, Intron and Other RNAs. BMC Bioinf 3.
15. TreeBASE: A Database of Phylogenetic Knowledge. http://www.treebase.org/treebase/index.html.
16. Katoh K, Kuma K, Toh H, Miyata T, (2005) MAFFT version 5: improvement in accuracy of multiple sequence alignment. Nucl Acids Res 33: 511-518.
17. Katoh K, Toh H, (2007) PartTree: an algorithm to build an approximate tree from a large number of unaligned sequences. Bioinf 23: 372-374.
18. Katoh K, Toh H, (2008) Recent developments in the MAFFT multiple sequence alignment program. Brief Bioinf 9: 286-298.
19. Litzkow M, (1987) Remote Unix- turning idle workstations into cycle servers. pp. 381-384 In: Usenix Summer Conference.