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

By Lam-Tung Nguyen, Heiko A. Schmidt, A. von Haeseler, Bui Quang Minh. 2014

22,631 citations recorded by the source corpus.

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%.

Subfields: Artificial Intelligence, Molecular Biology, Plant Science

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Guangchuang Yu
  2. A. von Haeseler
  3. Bui Quang Minh
  4. Olga Chernomor
  5. Trevor Bedford
  6. K. Kistler
  7. Amanda Birmingham
  8. Yoshiki Vazquez-Baeza

In Molecular Biology

  1. Rob Knight
  2. Peer Bork
  3. Curtis Huttenhower
  4. Ivica Letunic
  5. Nicola Segata
  6. J. Gregory Caporaso
  7. Lars Juhl Jensen
  8. C. von Mering

In Plant Science

  1. Guangchuang Yu
  2. A. von Haeseler
  3. Bui Quang Minh
  4. Olga Chernomor
  5. K. Kistler
  6. Trevor Bedford
  7. Rob Knight
  8. J. Gregory Caporaso

Citations in the corpus