Cited by 4,949Genomics and Phylogenetic StudiesGenome Rearrangement AlgorithmsFractal and DNA sequence analysis

Mauve: Multiple alignment of conserved genomic sequence with rearrangements

Open access
Darling, Aaron C.E., Mau, Bob, Blattner, Frederick R., Perna, Nicole T.·2004·Genome Research

Abstract

As genomes evolve, they undergo large-scale evolutionary processes that present a challenge to sequence comparison not posed by short sequences. Recombination causes frequent genome rearrangements, horizontal transfer introduces new sequences into bacterial chromosomes, and deletions remove segments of the genome. Consequently, each genome is a mosaic of unique lineage-specific segments, regions shared with a subset of other genomes and segments conserved among all the genomes under consideration. Furthermore, the linear order of these segments may be shuffled among genomes. We present methods for identification and alignment of conserved genomic DNA in the presence of rearrangements and horizontal transfer. Our methods have been implemented in a software package called Mauve. Mauve has been applied to align nine enterobacterial genomes and to determine global rearrangement structure in three mammalian genomes. We have evaluated the quality of Mauve alignments and drawn comparison to other methods through extensive simulations of genome evolution.

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.1101/gr.2289704

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?

  • Anchor-based methods use a set of anchor sequences, typically a subset of the input sequences, to guide the alignment of the remaining sequences in the dataset.

    “Anchor-based methods use a set of anchor sequences, which are typically a subset of the input sequences, to guide the alignment of the remaining sequences in the dataset [27].”

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

    The Methods section defines Mauve’s anchors as matching subsequences (multi-MUMs) shared by genomes, not as a subset of the input sequences. The paper does say those anchors guide subsequent alignment, but its description contradicts the claim’s characterization of what the anchors are. (LLM, conf=0.87)

    Checked by a reasoning model — may be wrong.

    Experimental — accuracy not yet measured
  • Some algorithms, like Mauve and Progressive Cactus, have built-in features for handling genomic rearrangements.

    “Some algorithms, like Mauve and Progressive Cactus, have built-in features for handling these rearrangements [27].”

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

    The Abstract says Mauve was developed to align genomic DNA in the presence of rearrangements, and the Methods describe its breakpoint-elimination algorithm for noncollinear anchoring. Our copy does not address Progressive Cactus, so it supports the claim about Mauve but not the claim about both algorithms. (LLM, conf=0.88)

    Experimental — accuracy not yet measured
  • Mauve can identify entire similar regions between a set of genomes, such as rearrangements, translocations, and inversions, and the exact breakpoints of each rearrangement across multiple genomes.

    “Mauve is a genome alignment method which is able to identify entire similar regions between a set of genomes, such as rearrangements, translocation, and inversions, and the exact breakpoints of each rearrangement across multiple genomes [27].”
  • Other algorithms may require additional steps or tools to correctly align regions with genomic rearrangements.

    “Other algorithms may require additional steps or tools to correctly align regions with genomic rearrangements [27].”

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

  1. Blanchette, M., Bourque, G., and Sankoff, D. 1997. Breakpoint phylogenies. Genome Inform Ser. Workshop Genome Inform. 8: 25-34.
  2. Kurtz, S., Ohlebusch, E., Schleiermacher, C., Stoye, J., and Giegerich, R. 2000. Computation and visualization of degenerate repeats in complete genomes. Proc. Int. Conf. Intell. Syst. Mol. Biol. 8: 228-238.
  3. Martins, W.S., del Cuvillo, J., Cui, W., and Gao, G.R. 2001. Whole genome alignment using a multithreaded parallel implementation. Symposium on Computer Architecture and High Performance Computing, pp. 1-8.
  4. Morgenstern, B., Dress, A., and Werner, T. 1996. Multiple DNA and protein sequence alignment based on segment-to-segment comparison. Proc. Natl. Acad. Sci. 93: 12098-12103.
  5. ---. 2003b. Human and mouse genomic sequences reveal extensive breakpoint reuse in mammalian evolution. Proc. Natl. Acad. Sci. 100: 7672-7677.
  6. Welch, R.A., Burland, V., Plunkett III, G., Redford, P., Roesch, P., Rasko, D., Buckles, E.L., Liou, S.-R., Boutin, A., Hackett, J., et al. 2002. Extensive mosaic structure revealed by the complete genome sequence of uropathogenic Escherichia coli. Proc. Natl. Acad. Sci. 99: 17020-17024.

Cited by

Sorted by citations

Authors
Darling, A. C. E., Mau, B., Blattner, F. R., & Perna, N. T.
Affiliations
University of Wisconsin–Madison (US)
Venue
Genome Research
Published
2004-07
Volume
14
Issue
7
Pages
1394-1403
ISSN
1088-9051 (ISSN-L)
OpenAlex
W7095603021
Cited by
4,949
References
1
Citations by year
2026: 270 · 2025: 375 · 2024: 443 · 2023: 389 · 2022: 438 · 2021: 405 · 2020: 420 · 2019: 367 · 2018: 280 · 2017: 286 · 2016: 245 · 2015: 189 · 2014: 181 · 2013: 139 · 2012: 133
Type
posted content
Language
en
Open access
Locations
  • Genome Research (publishedVersion)
  • PubMed Central (publishedVersion)
  • PubMed (publishedVersion)
  • UTS ePRESS (University of Technology Sydney) (submittedVersion)
  • OPUS - Open Publications of UTS Scholars (University of Technology Sydney) (submittedVersion)
Funders
  • National Institutes of Health
  • National Institute of General Medical Sciences (GM62994-02, R01GM062994)
  • U.S. National Library of Medicine (T15LM007359)
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 › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Fractal and DNA sequence analysis
Keywords
multiple sequence alignment, genome rearrangement, comparative genomics, sequence alignment software
MeSH terms
Chromosomes, Bacterial, Computer Simulation, DNA, Bacterial, Enterobacteriaceae, Escherichia coli, Recombination, Genetic, Salmonella typhi, Salmonella typhimurium, Shigella flexneri, Software, Software Design, Software Validation, Species Specificity, Sequence Alignment, Genome, Bacterial, Conserved Sequence, Escherichia coli O157

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