Cited by 369Genome Rearrangement AlgorithmsGenomic variations and chromosomal abnormalitiesChromosomal and Genetic Variations

Genome rearrangements in mammalian evolution: lessons from human and mouse genomes

Open access
Pevzner, Pavel, Tesler, Glenn·2003·Genome Research

Abstract

Although analysis of genome rearrangements was pioneered by Dobzhansky and Sturtevant 65 years ago, we still know very little about the rearrangement events that produced the existing varieties of genomic architectures. The genomic sequences of human and mouse provide evidence for a larger number of rearrangements than previously thought and shed some light on previously unknown features of mammalian evolution. In particular, they reveal that a large number of microrearrangements is required to explain the differences in draft human and mouse sequences. Here we describe a new algorithm for constructing synteny blocks, study arrangements of synteny blocks in human and mouse, derive a most parsimonious human–mouse rearrangement scenario, and provide evidence that intrachromosomal rearrangements are more frequent than interchromosomal rearrangements. Our analysis is based on the human–mouse breakpoint graph, which reveals related breakpoints and allows one to find a most parsimonious scenario. Because these graphs provide important insights into rearrangement scenarios, we introduce a new visualization tool that allows one to view breakpoint graphs superimposed with genomic dot-plots. [Supplemental material is available online at www.genome.org.]

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.757503

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?

  • FWM can be seen to a lesser extent over more recently diverged genomes if they evolve relatively slowly, such as the similar-yet-rearranged karyotypes of human and mouse.

    “FWM can be seen to a lesser extent over more recently diverged genomes if they evolve relatively slowly, such as the similar-yet-rearranged karyotypes of human and mouse (70).”

    From Topological Approaches in Animal Comparative Genomics (2026) · cites this paper as [70]

    The Synteny Blocks section reports that human and mouse share 281 synteny blocks but have undergone at least 245 rearrangements, supporting the similar-yet-rearranged comparison. Our copy does not discuss FWM or show that it is visible in these genomes; the Genome Rearrangements section also cautions that rodents may have unusually rapid chromosome alterations, rather than establishing the claimed slow evolution. (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: 8

  1. Bafna, V. and Pevzner, P.A. 1993. Genome rearrangements and sorting by reversals. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, pp. 148-157.
  2. Hannenhalli, S. and Pevzner, P.A. 1995a. Transforming men into mice (polynomial algorithm for genomic distance problem). In Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, pp. 581-592. IEEE, Milwaukee, Wisconsin.
  3. ---. 1995b. Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). In Proceedings of the 27th Annual ACM Symposium on the Theory of Computing, pp. 178-189.
  4. ---. 1999. Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). J. ACM 46: 1-27.
  5. Nadeau, J.H. and Taylor, B.A. 1984. Lengths of chromosomal segments conserved since divergence of man and mouse. Proc. Natl. Acad. Sci. 81: 814-818.
  6. Sankoff, D. and Blanchette, M. 1997. The median problem for breakpoints in comparative genomics. In Computing and Combinatorics, Proceedings of COCOON '97, Lecture notes in computer science, pp. 251-263. Springer Verlag, New York.
  7. Sturtevant, A.H. and Dobzhansky, T. 1936. Inversions in the third chromosome of wild races of Drosophila pseudoobscura, and their use in the study of the history of the species. Proc. Natl. Acad. Sci. 22: 448-450.
  8. ---. 2002b. Efficient algorithms for multichromosomal genome rearrangements. J. Comp. Sys. Sci. (in press).

Cited by

Sorted by citations

Authors
Pevzner, P., & Tesler, G.
Affiliations
University of California San Diego (US)
Venue
Genome Research
Published
2002-12-30
Volume
13
Issue
1
Pages
37-45
ISSN
  • 1088-9051 (ISSN-L)
  • 1549-5469
OpenAlex
W7098492624
Cited by
369
References
1
Citations by year
2026: 7 · 2025: 5 · 2024: 5 · 2023: 22 · 2022: 10 · 2021: 7 · 2020: 12 · 2019: 7 · 2018: 13 · 2017: 6 · 2016: 12 · 2015: 7 · 2014: 6 · 2013: 6 · 2012: 14
Type
posted content
Language
en
Open access
Locations
  • Genome Research (publishedVersion)
  • PubMed Central (publishedVersion)
  • PubMed (publishedVersion)
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Genetics › Genome Rearrangement Algorithms
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Genetics › Genomic variations and chromosomal abnormalities
  • Life Sciences › Agricultural and Biological Sciences › Plant Science › Chromosomal and Genetic Variations
Keywords
genome rearrangement, mammalian evolution, synteny blocks, breakpoint graph, intrachromosomal rearrangements, interchromosomal rearrangements
MeSH terms
Algorithms, Animals, Chromosomes, Chromosomes, Human, Humans, Mammals, Gene Rearrangement, Genome, Human, Genome, Computational Biology, Synteny, Mice

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