Cited by 1,036Genomics and Phylogenetic StudiesGenome Rearrangement AlgorithmsAlgorithms and Data Compression

Fast algorithms for large-scale genome alignment and comparison

Open access
Delcher, A. L.·2002·Nucleic Acids Research

Abstract

We describe a suffix-tree algorithm that can align the entire genome sequences of eukaryotic and prokaryotic organisms with minimal use of computer time and memory. The new system, MUMmer 2, runs three times faster while using one-third as much memory as the original MUMmer system. It has been used successfully to align the entire human and mouse genomes to each other, and to align numerous smaller eukaryotic and prokaryotic genomes. A new module permits the alignment of multiple DNA sequence fragments, which has proven valuable in the comparison of incomplete genome sequences. We also describe a method to align more distantly related genomes by detecting protein sequence homology. This extension to MUMmer aligns two genomes after translating the sequence in all six reading frames, extracts all matching protein sequences and then clusters together matches. This method has been applied to both incomplete and complete genome sequences in order to detect regions of conserved synteny, in which multiple proteins from one organism are found in the same order and orientation in another. The system code is being made freely available by the authors.

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/nar/30.11.2478

Cites

1 of 1 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?

  • MUMmer 2.1 required less memory and ran the four steps faster than the previous version.

    “For that reason, the authors proposed a new method that required less memory and ran the four steps faster [13].”

    From Whole-Genome Alignment: Methods, Challenges, and Future Directions (2024) · cites this paper as [13]

    The Algorithmic Improvements section (page not provided) reports that MUMmer 2 used less memory and aligned the same genomes faster than MUMmer 1.0. The copy does not establish that each of four steps ran faster or identify the improved system specifically as version 2.1. (LLM, conf=0.85)

    Experimental — accuracy not yet measured

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

Research works printed but not linked: 2

  1. Pearson,W.R. (2000) Flexible sequence similarity searching with the FASTA3 program package. Methods Mol. Biol., 132, 185-219.
  2. Gusfield,D. (1997) Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, New York.

Cited by

Sorted by citations

Authors
Delcher, A. L.
Affiliations
Loyola University Maryland (US)
Corresponding author
Delcher, A. L.
Venue
Nucleic Acids Research
Published
2002-06-01
Volume
30
Issue
11
Pages
2478-2483
ISSN
  • 0305-1048 (ISSN-L)
  • 1362-4962
OpenAlex
W2095685450
Cited by
1,036
References
1
Citations by year
2026: 16 · 2025: 23 · 2024: 44 · 2023: 35 · 2022: 44 · 2021: 53 · 2020: 74 · 2019: 48 · 2018: 48 · 2017: 79 · 2016: 54 · 2015: 51 · 2014: 53 · 2013: 41 · 2012: 28
FWCI
13.34
Type
journal article
Language
en
Open access
Locations
  • Nucleic Acids Research (publishedVersion)
  • PubMed Central (publishedVersion)
  • PubMed (publishedVersion)
Funders
  • National Science Foundation
  • National Institutes of Health
  • U.S. Public Health Service (R01-A142243)
  • National Institute of Allergy and Infectious Diseases
  • U.S. National Library of Medicine (R01LM006845)
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Genomics and Phylogenetic Studies
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Genetics › Genome Rearrangement Algorithms
  • Physical Sciences › Computer Science › Artificial Intelligence › Algorithms and Data Compression
Keywords
genome alignment, comparative genomics, multiple sequence alignment, protein homology, conserved synteny, human genome, mouse genome, eukaryotic genomes, prokaryotic genomes, memory-efficient alignment
MeSH terms
Algorithms, Animals, Computers, Humans, Plasmodium, Software, Time Factors, Genome, Human, Sequence Alignment, Genome, Genome, Bacterial, Genome, Protozoan, Computational Biology, Contig Mapping, Genomics

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