Science Explorer Back to mapMap
Topic · Genetics

Genome Rearrangement Algorithms

Genome Rearrangement Algorithms is a research topic within Genetics. Science Explorer counts 3k research works in it since 1954. 10.5% of them reached the world's top 10% most cited for their field and year.

This cluster of papers focuses on the study of genomic rearrangements, evolutionary genomics, and ancestral genome reconstruction. It explores topics such as comparative genomics, chromosome evolution, phylogenetic analysis based on gene order, genome distance estimation, breakpoint reuse in evolution, and the role of duplications and inversions in shaping genomes.

  • Genomic Rearrangements
  • Evolutionary Genomics
  • Ancestral Genome Reconstruction
  • Comparative Genomics
  • Chromosome Evolution
  • Phylogenetic Analysis
  • Gene Order Phylogeny
  • Genome Distance Estimation
  • Breakpoint Reuse
  • Duplication and Inversion
Research works
3k
fractional, since 1954
In the world top 10%
313
per year above
Top-10% rate
10.5%
share of its works in the world top 10%
Growth, 2018-21 → 2022-25
-5%
the tick is no change
Largest producer
United States
33% of the 10 largest, 2022-now

Which countries lead Genome Rearrangement Algorithms research?

By volume, the United States and China publish the most (122 and 79 works in 2022-now).

By volume, 2022-now

  1. 1 United States 122 works
  2. 2 China 79 works
  3. 3 Germany 33 works
  4. 4 France 28 works
  5. 5 India 23 works
  6. 6 United Kingdom 22 works
  7. 7 Canada 20 works
  8. 8 Japan 17 works
  9. 9 Russia 15 works
  10. 10 Italy 14 works

How concentrated that is

The same countries as shares of everything the list above accounts for. A node where two countries do two thirds of the work and one spread evenly across twelve read alike as a ranking and not at all alike here.

United States: 32.6%China: 21.1%Germany: 8.9%France: 7.5%6 others listed: 29.9%33%largest
United States122 · 32.6%China79 · 21.1%Germany33 · 8.9%France28 · 7.5%6 others listed111 · 29.9%

Shares of the rows listed above, not of the whole node.

Which institutions lead Genome Rearrangement Algorithms research?

By volume in 2022-now, Centre National de la Recherche Scientifique publishes the most Genome Rearrangement Algorithms research, followed by Chinese Academy of Sciences and University of California San Diego.

Who are the leading researchers in Genome Rearrangement Algorithms?

The most-cited researchers publishing on Genome Rearrangement Algorithms include Rob Knight, Richard M. Durbin and Peer Bork.

  1. 1 Rob Knight United States 468k citations
  2. 2 Richard M. Durbin United Kingdom 410k citations
  3. 3 Peer Bork Germany 396k citations
  4. 4 Steven L. Salzberg United States 372k citations
  5. 5 Jun Wang China 340k citations
  6. 6 Sudhir Kumar United States 295k citations
  7. 7 Richard A. Gibbs United States 292k citations
  8. 8 Heng Li United States 270k citations
  9. 9 Koichiro Tamura Japan 268k citations
  10. 10 Eugene V. Koonin United States 217k citations

Ranked by citations received across their whole record, among researchers with at least three works on this topic.

What are the most cited papers in Genome Rearrangement Algorithms?

The most cited paper in Genome Rearrangement Algorithms is "Fast and accurate short read alignment with Burrows–Wheeler transform" (Heng Li, Richard M. Durbin, 2009), with 63,989 citations. Next come "BLAST+: architecture and applications" (24,075) and "FastTree 2 – Approximately Maximum-Likelihood Trees for Large Alignments" (16,398).

Most cited papers
#PaperReleasedCitations
1 Fast and accurate short read alignment with Burrows–Wheeler transform Heng Li, Richard M. Durbin · Bioinformatics Open access 18 May 2009 63,989
2 BLAST+: architecture and applications Christiam Camacho, George Coulouris, Vahram Avagyan et al. · BMC Bioinformatics Open access Dec 2009 24,075
3 FastTree 2 – Approximately Maximum-Likelihood Trees for Large Alignments Morgan N. Price, Paramvir Dehal, Adam P. Arkin · PLoS ONE Open access 9 Mar 2010 16,398
4 FLASH: fast length adjustment of short reads to improve genome assemblies Tanja Magoč, Steven L. Salzberg · Bioinformatics Open access 7 Sep 2011 16,123
5 RAxML-VI-HPC: maximum likelihood-based phylogenetic analyses with thousands of taxa and mixed models Alexandros Stamatakis · Bioinformatics Open access 23 Aug 2006 16,023
All 99 most cited papers, with filters and sorting

Where is Genome Rearrangement Algorithms research done?

The largest centres of Genome Rearrangement Algorithms research in 2022-now are Beijing (China), Paris (France), Moscow (Russia) and Tokyo (Japan).

Largest cities, 2022-now

  1. 1 BeijingChina 15 works
  2. 2 ParisFrance 9 works
  3. 3 MoscowRussia 7 works
  4. 4 TokyoJapan 6 works
  5. 5 San DiegoUnited States 6 works
  6. 6 QingdaoChina 5 works
  7. 7 New YorkUnited States 5 works
  8. 8 ViennaAustria 5 works
  9. 9 CampinasBrazil 5 works
  10. 10 HelsinkiFinland 4 works
See Genome Rearrangement Algorithms on the map

Is Genome Rearrangement Algorithms research growing?

Output in 2022-2025 was 5% lower than in 2018-2021, peaking in 2026.

still counting19801990200020102020
grewheldshrank

The same series as a ribbon: one cell per year, darker for more. The line above answers how much; this answers when.

Its share of all research

Growing output can still be a shrinking share: all of science grows. This is Genome Rearrangement Algorithms as a percentage of every work published that year, 0.0013% in 2024.

still counting0.0020%0.0040%0.0060%Genome Rearrangement Algorithms0.0024% in 202519801990200020102020

Fractional works of Genome Rearrangement Algorithms over all fractional works that year. How the balance of science has shifted.

How much of it reaches the world top 10%

Year by year.

still counting5%10%15%Genome Rearrangement Algorithms10.8% in 2025200020102020

Of each year's works in it, the share that reached the world's 10% most cited for their field and year. A field is the world for its own topics, so there is no other line to hold it against.

Which topics inside it are moving

Growth and decline on one axis around a shared zero. Two lists side by side hide the thing that matters: whether the growth dwarfs the decline, or the other way round.

Discussion

Ask a question or share a note about Genome Rearrangement Algorithms. Posts are plain text and can be reported.