Cited by 2,484Genomics and Phylogenetic StudiesAlgorithms and Data CompressionGenome Rearrangement Algorithms

MUMmer4: A fast and versatile genome alignment system

Open access
Marçais, Guillaume, Delcher, Arthur L., Phillippy, Adam M., Coston, Rachel, Salzberg, Steven L., Zimin, Aleksey·2018·PLOS Computational Biology

Abstract

The MUMmer system and the genome sequence aligner nucmer included within it are among the most widely used alignment packages in genomics. Since the last major release of MUMmer version 3 in 2004, it has been applied to many types of problems including aligning whole genome sequences, aligning reads to a reference genome, and comparing different assemblies of the same genome. Despite its broad utility, MUMmer3 has limitations that can make it difficult to use for large genomes and for the very large sequence data sets that are common today. In this paper we describe MUMmer4, a substantially improved version of MUMmer that addresses genome size constraints by changing the 32-bit suffix tree data structure at the core of MUMmer to a 48-bit suffix array, and that offers improved speed through parallel processing of input query sequences. With a theoretical limit on the input size of 141Tbp, MUMmer4 can now work with input sequences of any biologically realistic length. We show that as a result of these enhancements, the nucmer program in MUMmer4 is easily able to handle alignments of large genomes; we illustrate this with an alignment of the human and chimpanzee genomes, which allows us to compute that the two species are 98% identical across 96% of their length. With the enhancements described here, MUMmer4 can also be used to efficiently align reads to reference genomes, although it is less sensitive and accurate than the dedicated read aligners. The nucmer aligner in MUMmer4 can now be called from scripting languages such as Perl, Python and Ruby. These improvements make MUMer4 one the most versatile genome alignment packages available.

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.1371/journal.pcbi.1005944

Cites

9 of 9 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's suffix tree-based MUM finding algorithm provides an efficient and accurate method for identifying conserved regions and similarities between large genomic sequences.

    “Its suffix tree-based MUM finding algorithm provides an efficient and accurate method for identifying conserved regions and similarities between large genomic sequences [18].”

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

    The MUMmer3 implementation section says its suffix tree finds maximal unique matches between sequences, supporting the description of MUM finding. But the MUMmer4 implementation section says MUMmer4 replaced the suffix tree with a suffix array. The claim therefore describes the older algorithm, not the MUMmer4 algorithm for aligning large genomes. (LLM, conf=0.87)

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

  1. [1]Kurtz S, Phillippy A, Delcher AL, Smoot M, Shumway M, Antonescu C, et al Versatile and open software for comparing large genomes. Genome Biology. 2004; 5(2): R12 doi: 10.1186/gb-2004-5-2-r12 14759262 PMC395750 · DOI · Paper page
  2. [5]Kent WJ. BLAT—The BLAST-Like Alignment Tool. Genome Research. 2002; 12(4): 656– 664. doi: 10.1101/gr.229202 11932250 PMC187518 · DOI · Paper page
  3. [6]Darling ACE, Mau B, Blattner FR, Perna NT. Mauve: Multiple Alignment of Conserved Genomic Sequence With Rearrangements. Genome Research. 2004; 14(7): 1394– 1403. doi: 10.1101/gr.2289704 15231754 PMC442156 · DOI · Paper page
  4. [8]Chaisson MJ, Tesler G. Mapping single molecule sequencing reads using basic local alignment with successive refinement (BLASR): application and theory. BMC Bioinformatics. 2012; 13(1): 238 doi: 10.1186/1471-2105-13-238 22988817 PMC3572422 · DOI
  5. [9]Delcher AL, Kasif S, Fleischmann RD, Peterson J, White O, Salzberg SL. Alignment of whole genomes. Nucleic Acids Research. 1999; 27(11): 2369– 2376. doi: 10.1093/nar/27.11.2369 10325427 PMC148804 · DOI · Paper page
  6. [11]Smith TF, Waterman MS. Identification of common molecular subsequences. Journal of Molecular Biology. 1981; 147(1): 195– 197. doi: 10.1016/0022-2836(81)90087-5 7265238 · DOI
  7. [12]Vyverman M, Baets BD, Fack V, Dawyndt P. essaMEM: finding maximal exact matches using enhanced sparse suffix arrays. Bioinformatics. 2013; p. btt042. doi: 10.1093/bioinformatics/btt042 23349213 · DOI
  8. [13]Larsson NJ, Sadakane K. Faster suffix sorting. Theoretical Computer Science. 2007; 387(3): 258– 272. doi: 10.1016/j.tcs.2007.07.017 · DOI
  9. [15]Stevens KA, Wegrzyn JL, Zimin A, Puiu D, Crepeau M, Cardeno C, et al Sequence of the Sugar Pine Megagenome. Genetics. 2016; 204(4): 1613– 1626. doi: 10.1534/genetics.116.193227 27794028 PMC5161289 · DOI
  10. [17]Beazley DM, others. SWIG: An easy to use tool for integrating scripting languages with C and C++. In: Proceedings of the 4th USENIX Tcl/Tk workshop; 1996. p. 129–139. Available from: https://www.usenix.org/legacy/publications/library/proceedings/tcl96/full_papers/beazley.
  11. [18]Kaul S, Koo H, Jenkins J, Rizzo M, Rooney T, Tallon L, et al Analysis of the genome sequence of the flowering plant Arabidopsis thaliana. Nature. 2000; 408(6814): 796– 815. doi: 10.1038/35048692 11130711 · DOI · Paper page
  12. [21]Hu TT, Pattyn P, Bakker EG, Cao J, Cheng JF, Clark RM, et al The Arabidopsis lyrata genome sequence and the basis of rapid genome size change. Nature genetics. 2011; 43(5): 476– 481. doi: 10.1038/ng.807 21478890 PMC3083492 · DOI
  13. [22]Lee H, Gurtowski J, Yoo S, Marcus S, McCombie WR, Schatz M. Error correction and assembly complexity of single molecule sequencing reads. bioRxiv. 2014;
  14. [25]Mikkelsen TS, Hillier LW, Eichler EE, Zody MC, et al Initial sequence of the chimpanzee genome and comparison with the human genome. Nature. 2005; 437(7055): 69 doi: 10.1038/nature04072 16136131 · DOI · Paper page
  15. [27]Koutsovoulos G, Kumar S, Laetsch DR, Stevens L, Daub J, Conlon C, et al No evidence for extensive horizontal gene transfer in the genome of the tardigrade Hypsibius dujardini. Proceedings of the National Academy of Sciences. 2016; 113(18): 5053– 5058. doi: 10.1073/pnas.1600338113 PMC4983863 27035985 · DOI · Paper page
  16. [28]Ono Y, Asai K, Hamada M. PBSIM: PacBio reads simulator—toward accurate genome assembly. Bioinformatics. 2012; 29(1): 119– 121. doi: 10.1093/bioinformatics/bts649 23129296 · DOI

Cited by

Sorted by citations

Authors
Marçais, G., Delcher, A. L., Phillippy, A. M., Coston, R., Salzberg, S. L., & Zimin, A.
Affiliations
  • University of Maryland, College Park (US)
  • Johns Hopkins University (US)
  • National Human Genome Research Institute (US)
Corresponding author
  • Marçais, Guillaume
  • Zimin, Aleksey
Venue
PLOS Computational Biology
Published
2018-01-26
Volume
14
Issue
1
Pages
e1005944
ISSN
  • 1553-734X (ISSN-L)
  • 1553-7358
OpenAlex
W2784788330
Cited by
2,484
References
9
Citations by year
2026: 462 · 2025: 460 · 2024: 380 · 2023: 358 · 2022: 314 · 2021: 257 · 2020: 151 · 2019: 75 · 2018: 25
FWCI
45.85
Type
journal article
Language
en
Open access
Locations
  • PLoS Computational Biology (publishedVersion, public-domain)
  • PubMed Central (publishedVersion, public-domain)
  • PubMed (publishedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
Funders
  • National Institutes of Health (R01 GM083873)
  • Gordon and Betty Moore Foundation (GBMF4554)
  • National Science Foundation (IOS-1238231, ABR-PG-144893)
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Genomics and Phylogenetic Studies
  • Physical Sciences › Computer Science › Artificial Intelligence › Algorithms and Data Compression
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Genetics › Genome Rearrangement Algorithms
Keywords
genome alignment, suffix arrays, suffix trees, parallel computing, read mapping, genome assembly comparison
MeSH terms
Algorithms, Animals, Pan troglodytes, Humans, Models, Theoretical, Programming Languages, Software, Genome, Human, Sequence Alignment, Arabidopsis, Sequence Analysis, DNA, Genome, Plant, Computational Biology, Sequence Analysis, Protein, Polymorphism, Single Nucleotide, 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