Cited by 5,254Genomics and Phylogenetic StudiesGenome Rearrangement AlgorithmsChromosomal and Genetic Variations

Versatile and open software for comparing large genomes

Open access
Kurtz, Stefan, Phillippy, Adam, Delcher, Arthur L, Smoot, Michael, Shumway, Martin, Antonescu, Corina, Salzberg, Steven L·2004·Genome Biology

Abstract

The newest version of MUMmer easily handles comparisons of large eukaryotic genomes at varying evolutionary distances, as demonstrated by applications to multiple genomes. Two new graphical viewing tools provide alternative ways to analyze genome alignments. The new system is the first version of MUMmer to be released as open-source software. This allows other developers to contribute to the code base and freely redistribute the code. The MUMmer sources are available at http://www.tigr.org/software/mummer .

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.1186/gb-2004-5-2-r12

Cites

6 of 6 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 3.0 uses all maximal matches, including non-unique ones, to align two genomes.

    “To overcome this problem, the new MUMmer 3.0 uses all maximal matches including non-unique ones to align the two genomes [19].”

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

    The Results section (“Non-unique maximal matches”) says MUMmer 3.0 can find all maximal matches, including non-unique ones, between two sequences. It specifies that this requires a command-line option; the claim presents it as what MUMmer 3.0 uses without that qualification. (LLM, conf=0.86)

    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: 26

  1. Pearson WR Lipman DJ Improved tools for biological sequence comparison. Proc Natl Acad Sci USA 1988 85 2444 2448 3162770 PMC280013
  2. Delcher AL Kasif S Fleischmann RD Peterson J White O Salzberg SL Alignment of whole genomes. Nucleic Acids Res 1999 27 2369 76 10325427 10.1093/nar/27.11.2369 PMC148804 · DOI · Paper page
  3. Delcher AL Phillippy A Carlton J Salzberg SL Fast algorithms for large-scale genome alignment and comparison. Nucleic Acids Res 2002 30 2478 2483 12034836 10.1093/nar/30.11.2478 PMC117189 · DOI · Paper page
  4. Carlton JM Angiuoli SV Suh BB Kooij TW Pertea M Silva JC Ermolaeva MD Allen JE Selengut JD Koo HL Genome sequence and comparative analysis of the model rodent malaria parasite Plasmodium yoelii yoelii. Nature 2002 419 512 519 12368865 10.1038/nature01099 · DOI
  5. Myers EW Sutton GG Delcher AL Dew IM Fasulo DP Flanigan MJ Kravitz SA Mobarry CM Reinert KH Remington KA A whole-genome assembly of Drosophila. Science 2000 287 2196 2204 10731133 10.1126/science.287.5461.2196 · DOI
  6. Batzoglou S Jaffe DB Stanley K Butler J Gnerre S Mauceli E Berger B Mesirov JP Lander ES ARACHNE: a whole-genome shotgun assembler. Genome Res 2002 12 177 189 11779843 10.1101/gr.208902 PMC155255 · DOI
  7. Gordon D Abajian C Green P Consed: a graphical tool for sequence finishing. Genome Res 1998 8 195 202 9521923
  8. Huang X Madan A CAP3: A DNA sequence assembly program. Genome Res 1999 9 868 877 10508846 10.1101/gr.9.9.868 PMC310812 · DOI · Paper page
  9. Ning Z Cox AJ Mullikin JC SSAHA: a fast search method for large DNA databases. Genome Res 2001 11 1725 1729 11591649 10.1101/gr.194201 PMC311141 · DOI · Paper page
  10. Bray N Dubchak I Pachter L AVID: a global alignment program. Genome Res 2003 13 97 102 12529311 10.1101/gr.789803 PMC430967 · DOI
  11. Hohl M Kurtz S Ohlebusch E Efficient multiple genome alignment. Bioinformatics 2002 18 Suppl 1 S312 S320 12169561
  12. Schwartz S Kent WJ Smit A Zhang Z Baertsch R Hardison RC Haussler D Miller W Human-mouse alignments with BLASTZ. Genome Res 2003 13 103 107 12529312 10.1101/gr.809403 PMC430961 · DOI
  13. Brudno M Do CB Cooper GM Kim MF Davydov E Green ED Sidow A Batzoglou S LAGAN and Multi-LAGAN: efficient tools for large-scale multiple alignment of genomic DNA. Genome Res 2003 13 721 731 12654723 10.1101/gr.926603 PMC430158 · DOI · Paper page
  14. Chain P Kurtz S Ohlebusch E Slezak T An applications-focused review of comparative genomics tools: capabilities, limitations and future challenges. Brief Bioinform 2003 4 105 123 12846393
  15. Dumas JP Ninio J Efficient algorithms for folding and comparing nucleic acid sequences. Nucleic Acids Res 1982 10 197 206 6174935 PMC326126
  16. Gusfield D Algorithms on Strings, Trees, and sequences: Computer Science and Computational Biology 1997 New York: Cambridge University Press
  17. Weiner P Linear pattern matching algorithms. In Proc 14th IEEE Symp Switching and Automata Theory 1973 Iowa City: University of Iowa 1 11
  18. McCreight EM A space-economical suffix tree construction algorithm. J Assoc Comp Mach 1976 23 262 272 10.1145/321941.321946 · DOI
  19. Kurtz S Reducing the space requirement of suffix trees. Software Practice Experience 1999 29 1149 1171 10.1002/(SICI)1097-024X(199911)29:13<1149::AID-SPE274>3.0.CO;2-O · DOI
  20. Kurtz S Choudhuri JV Ohlebusch E Schleiermacher C Stoye J Giegerich R REPuter: the manifold applications of repeat analysis on a genomic scale. Nucleic Acids Res 2001 29 4633 4642 11713313 10.1093/nar/29.22.4633 PMC92531 · DOI
  21. Smith TF Waterman MS Identification of common molecular subsequences. J Mol Biol 1981 147 195 197 7265238
  22. Pearson WR Flexible sequence similarity searching with the FASTA3 program package. Methods Mol Biol 2000 132 185 219 10547837
  23. Read TD Salzberg SL Pop M Shumway M Umayam L Jiang L Holtzapple E Busch JD Smith KL Schupp JM Comparative genome sequencing for discovery of novel polymorphisms in Bacillus anthracis. Science 2002 296 2028 2033 12004073 10.1126/science.1071837 · DOI
  24. Read TD Peterson SN Tourasse N Baillie LW Paulsen IT Nelson KE Tettelin H Fouts DE Eisen JA Gill SR The genome sequence of Bacillus anthracis Ames and comparison to closely related bacteria. Nature 2003 423 81 86 12721629 10.1038/nature01586 · DOI
  25. Fleischmann RD Alland D Eisen JA Carpenter L White O Peterson J DeBoy R Dodson R Gwinn M Haft D Whole-genome comparison of Mycobacterium tuberculosis clinical and laboratory strains. J Bacteriol 2002 184 5479 5490 12218036 10.1128/JB.184.19.5479-5490.2002 PMC135346 · DOI
  26. Zdobnov EM von Mering C Letunic I Torrents D Suyama M Copley RR Christophides GK Thomasova D Holt RA Subramanian GM Comparative genome and proteome analysis of Anopheles gambiae and Drosophila melanogaster. Science 2002 298 149 159 12364792 10.1126/science.1077061 · DOI · Paper page

Cited by

Sorted by citations

Authors
Kurtz, S., Phillippy, A., Delcher, A. L., Smoot, M., Shumway, M., Antonescu, C., & Salzberg, S. L.
Affiliations
  • Universität Hamburg (DE)
  • University of Virginia (US)
Corresponding author
Salzberg, Steven L
Venue
Genome Biology
Published
2004-01-30
Volume
5
Issue
2
Pages
R12-R12
ISSN
  • 1465-6906 (ISSN-L)
  • 1474-760X
OpenAlex
W2107282968
Cited by
5,254
References
6
Citations by year
2026: 208 · 2025: 245 · 2024: 319 · 2023: 302 · 2022: 370 · 2021: 526 · 2020: 455 · 2019: 383 · 2018: 348 · 2017: 327 · 2016: 255 · 2015: 237 · 2014: 248 · 2013: 240 · 2012: 164
FWCI
17.44
Type
journal article
Language
en
Open access
Locations
  • Genome biology (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, other-oa)
  • PubMed (publishedVersion)
  • University Libraries (University of Maryland) (submittedVersion)
Funders
  • National Science Foundation (0114792)
  • University of Virginia
  • Deutsche Forschungsgemeinschaft
  • National Institutes of Health (n01ai15447-36-0-3)
  • National Institute of General Medical Sciences (T32GM008715)
  • National Institute of Allergy and Infectious Diseases (N01 AI015447)
  • 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
  • Life Sciences › Agricultural and Biological Sciences › Plant Science › Chromosomal and Genetic Variations
Keywords
mummers, genome alignment, eukaryotic genomes, open source software, sequence alignment
MeSH terms
Animals, Anopheles, Computer Graphics, Drosophila, Humans, Software, Genome, Human, Sequence Alignment, Genome, Genome, Fungal, 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