Cited by 26,046Genomics and Phylogenetic StudiesRNA and protein synthesis mechanismsEvolution and Paleontology Studies

IQ-TREE: A Fast and Effective Stochastic Algorithm for Estimating Maximum-Likelihood Phylogenies

Open access
Nguyen, Lam-Tung, Schmidt, Heiko A., von Haeseler, Arndt, Minh, Bui Quang·2015·Molecular Biology and Evolution

Abstract

Large phylogenomics data sets require fast tree inference methods, especially for maximum-likelihood (ML) phylogenies. Fast programs exist, but due to inherent heuristics to find optimal trees, it is not clear whether the best tree is found. Thus, there is need for additional approaches that employ different search strategies to find ML trees and that are at the same time as fast as currently available ML programs. We show that a combination of hill-climbing approaches and a stochastic perturbation method can be time-efficiently implemented. If we allow the same CPU time as RAxML and PhyML, then our software IQ-TREE found higher likelihoods between 62.2% and 87.1% of the studied alignments, thus efficiently exploring the tree-space. If we use the IQ-TREE stopping rule, RAxML and PhyML are faster in 75.7% and 47.1% of the DNA alignments and 42.2% and 100% of the protein alignments, respectively. However, the range of obtaining higher likelihoods with IQ-TREE improves to 73.3-97.1%. IQ-TREE is freely available at http://www.cibiv.at/software/iqtree.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1093/molbev/msu300

Cites

34 of 34 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Preliminary analysis of commonly used nuclear and mitochondrial genes produced phylogenies with no statistical support for many key nodes.

    “Preliminary analysis of commonly used nuclear and mitochondrial genes, using IQ-TREE 1.6 (Nguyen, 2015) for model selection and tree inference, produced phylogenies with no statistical support for many key nodes.”
  • Best-fit partitions and substitution models were inferred with ModelFinder as implemented in IQ-TREE 1.6.12 with 20% relaxed clustering.

    “Best-fit partitions and substitution models were inferred with ModelFinder 12 , as implemented in IQ-TREE 1.6.12 2 , with 20% relaxed clustering”
  • The high performance of IQ-TREE results from the efficient integration of novel phylogenetic methods that improve the three key steps in phylogenetic analysis: fast model selection via ModelFinder, an effective tree search algorithm, and a novel ultrafast bootstrap approximation.

    “The high performance of IQ-TREE results from the efficient integration of novel phylogenetic methods that improve the three key steps in phylogenetic analysis: fast model selection via ModelFinder (Kalyaanamoorthy et al. 2017), an effective tree search algorithm (Nguyen et al. 2015), and a novel ultrafast bootstrap approximation (Minh et al. 2013; Hoang et al. 2018).”
  • In prior studies, RAxML and PhyML showed largely similar performance in identifying trees of higher likelihood scores, whereas IQ-TREE exhibited improved efficiency compared with both RAxML and PhyML.

    “In these studies, RAxML and PhyML showed largely similar performance in identifying trees of higher likelihood scores (Guindon et al. 2010; Money and Whelan 2012), whereas IQ-TREE exhibited improved efficiency compared with both RAxML and PhyML (Nguyen et al. 2015; Chernomor et al. 2016).”
  • Our single-gene tree inference results are consistent with previous smaller-scale studies on the better efficiency of IQ-TREE relative to RAxML and PhyML and the inferior performance of FastTree in likelihood score maximization.

    “Overall, our results at the level of single-gene tree inference are consistent with previous, smaller-scale studies on the better efficiency of IQ-TREE relative to RAxML and PhyML (all using one search per alignment) (Nguyen et al. 2015), and the inferior performance of FastTree in likelihood score maximization when compared with other programs (Guindon et al. 2010; Liu et al. 2011).”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Nguyen, L.-T., Schmidt, H. A., von Haeseler, A., & Minh, B. Q.
Affiliations
University of Vienna (AT)
Venue
Molecular Biology and Evolution
Published
2014-11-03
Volume
32
Issue
1
Pages
268-274
ISSN
  • 0737-4038 (ISSN-L)
  • 1537-1719
OpenAlex
W2111647009
Cited by
26,046
References
34
Citations by year
2026: 2889 · 2025: 3709 · 2024: 4129 · 2023: 3524 · 2022: 3424 · 2021: 3244 · 2020: 2420 · 2019: 1466 · 2018: 720 · 2017: 319 · 2016: 147 · 2015: 32 · 2014: 2 · 2013: 1 · 2012: 4
FWCI
68.43
Type
journal article
Language
en
Open access
Licence
cc-by-nc
Locations
  • Molecular Biology and Evolution (publishedVersion, cc-by-nc)
  • PubMed Central (publishedVersion, cc-by-nc)
  • PubMed (publishedVersion)
Funders
  • Austrian Science Fund (I760)
  • Universität Wien (I059-N)
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Genomics and Phylogenetic Studies
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › RNA and protein synthesis mechanisms
  • Physical Sciences › Earth and Planetary Sciences › Paleontology › Evolution and Paleontology Studies
Keywords
IQ-TREE, maximum likelihood phylogenetic inference, stochastic search, hill climbing, random perturbations, phylogenomics, stopping rules, RAxML, PhyML
MeSH terms
Algorithms, Phylogeny, Software, Time Factors, Likelihood Functions, Genome, Sequence Analysis, DNA, Computational Biology

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review