CoChat

FastTree: Computing Large Minimum Evolution Trees with Profiles instead of a Distance Matrix

Open access
Price, M. N., Dehal, P. S., Arkin, A. P. · 2009 · Molecular Biology and Evolution

The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.

Abstract

Gene families are growing rapidly, but standard methods for inferring phylogenies do not scale to alignments with over 10,000 sequences. We present FastTree, a method for constructing large phylogenies and for estimating their reliability. Instead of storing a distance matrix, FastTree stores sequence profiles of internal nodes in the tree. FastTree uses these profiles to implement Neighbor-Joining and uses heuristics to quickly identify candidate joins. FastTree then uses nearest neighbor interchanges to reduce the length of the tree. For an alignment with N sequences, L sites, and a different characters, a distance matrix requires O(N(2)) space and O(N(2)L) time, but FastTree requires just O(NLa + N ) memory and O(N log (N)La) time. To estimate the tree's reliability, FastTree uses local bootstrapping, which gives another 100-fold speedup over a distance matrix. For example, FastTree computed a tree and support values for 158,022 distinct 16S ribosomal RNAs in 17 h and 2.4 GB of memory. Just computing pairwise Jukes-Cantor distances and storing them, without inferring a tree or bootstrapping, would require 17 h and 50 GB of memory. In simulations, FastTree was slightly more accurate than Neighbor-Joining, BIONJ, or FastME; on genuine alignments, FastTree's topologies had higher likelihoods. FastTree is available at http://microbesonline.org/fasttree.

Overview

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.1093/molbev/msp077

Cites

42 of 42 references verified0 citation errors · 0 not checkable

Statistics

Figures

FIG. 1.— Overview of FastTree.
FIG. 1.— Overview of FastTree.CC BY-NC · PubMed Central
FIG. 2.— Distribution of support values for simulated alignments of 250 protein sequences with gaps. We compare the distribution of FastTree's local bootstrap and the traditional (global) bootstrap for correctly and incorrectly inferred splits. The right-most bin contains the strongly supported splits (0.95–1.0)
FIG. 2.— Distribution of support values for simulated alignments of 250 protein sequences with gaps. We compare the distribution of FastTree's local bootstrap and the traditional (global) bootstrap for correctly and incorrectly inferred splits. The right-most bin contains the strongly supported splits (0.95–1.0)CC BY-NC · PubMed Central

Verification

Claims the paper makes

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Self-check

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

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

Citations

Cites

Show all 42 references

Research works printed but not linked: 4

  1. 2001, Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing, 2001, 547
  2. 1998, 44, 837
  3. Saitou, 1987, Molecular Biology and Evolution, 4, 406
  4. Studier, 1988, Molecular Biology and Evolution, 5, 729

Cited by

Metadata

Authors
Price, M. N., Dehal, P. S., & Arkin, A. P.
Affiliations
Lawrence Berkeley National Laboratory (US)
Corresponding author
  • Price, M. N.
  • Dehal, P. S.
  • Arkin, A. P.
Venue
Molecular Biology and Evolution
Published
2009-04-17
Volume
26
Issue
7
Pages
1641-1650
ISSN
  • 0737-4038 (ISSN-L)
  • 1537-1719
OpenAlex
W2105329815
Cited by
5,602
References
42
Citations by year
2026: 460 · 2025: 573 · 2024: 638 · 2023: 571 · 2022: 496 · 2021: 511 · 2020: 503 · 2019: 393 · 2018: 314 · 2017: 279 · 2016: 227 · 2015: 182 · 2014: 143 · 2013: 112 · 2012: 77
FWCI
25.69
Type
journal article
Language
en
Open access
Licence
cc-by-nc
Locations
  • Molecular Biology and Evolution (publishedVersion)
  • PubMed Central (publishedVersion, cc-by-nc)
  • PubMed (publishedVersion)
  • OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) (submittedVersion)
  • University of North Texas Digital Library (University of North Texas) (submittedVersion)
  • eScholarship (California Digital Library) (submittedVersion)
  • Lawrence Berkeley National Laboratory
Funders
U.S. Department of Energy (-AC02-05CH11231, 05CH11231, DE AC02 05CH11231, DE-AC02-)
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
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Fractal and DNA sequence analysis
Keywords
FastTree, phylogenetic tree construction, minimum evolution, sequence profiles, neighbor-joining, 16S rRNA, nearest neighbor interchange
MeSH terms
Algorithms, Models, Genetic, Phylogeny, Proteins, Sequence Alignment, Evolution, Molecular

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

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.