Science Explorer Back to mapMap

Algorithms and Data Compression

Algorithms and Data Compression is a research topic within Artificial Intelligence. Science Explorer counts 37k research works in it since 1952. 9.9% of them reached the world's top 10% most cited for their field and year.

This cluster of papers focuses on the development and optimization of algorithms for compressing and indexing text data, with applications to genomic data, string matching, suffix arrays, and entropy-based compression techniques.

  • Compression
  • Suffix Arrays
  • Text Indexing
  • Data Structures
  • String Matching
  • Genomic Data
  • Entropy
  • Hashing
  • Approximate Matching
  • Algorithms
Research works
37k
fractional, since 1952
In the world top 10%
3.7k
per year above
Top-10% rate
9.9%
share of its works in the world top 10%
Growth, 2018-21 → 2022-25
-6%
the tick is no change
Largest producer
China
27% of the 10 largest, 2022-now

Which countries lead Algorithms and Data Compression research?

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

By volume, 2022-now

  1. 1 China 658 works
  2. 2 United States 646 works
  3. 3 India 309 works
  4. 4 Germany 186 works
  5. 5 Japan 135 works
  6. 6 France 130 works
  7. 7 United Kingdom 115 works
  8. 8 Italy 108 works
  9. 9 Canada 106 works
  10. 10 Russia 77 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.

China: 26.6%United States: 26.2%India: 12.5%Germany: 7.5%6 others listed: 27.2%27%largest
China658 · 26.6%United States646 · 26.2%India309 · 12.5%Germany186 · 7.5%6 others listed671 · 27.2%

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

Which institutions lead Algorithms and Data Compression research?

By volume in 2022-now, Centre National de la Recherche Scientifique publishes the most Algorithms and Data Compression research, followed by Chinese Academy of Sciences and Tsinghua University.

Who are the leading researchers in Algorithms and Data Compression?

The most-cited researchers publishing on Algorithms and Data Compression include Yoshua Bengio, Rob Knight and Geoffrey E. Hinton.

  1. 1 Yoshua Bengio Canada 476k citations
  2. 2 Rob Knight United States 468k citations
  3. 3 Geoffrey E. Hinton Canada 454k citations
  4. 4 Richard M. Durbin United Kingdom 410k citations
  5. 5 Peer Bork Germany 396k citations
  6. 6 Steven L. Salzberg United States 372k citations
  7. 7 Gad A. Getz United States 364k citations
  8. 8 Xiangyu Zhang 327k citations
  9. 9 Trevor Hastie United States 301k citations
  10. 10 Sudhir Kumar United States 295k 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 Algorithms and Data Compression?

The most cited paper in Algorithms and Data Compression is "Gapped BLAST and PSI-BLAST: a new generation of protein database search programs" (Stephen F. Altschul, 1997), with 75,032 citations. Next come "The Sequence Alignment/Map format and SAMtools" (69,061) and "Fast and accurate short read alignment with Burrows–Wheeler transform" (63,989).

Most cited papers
#PaperReleasedCitations
1 Gapped BLAST and PSI-BLAST: a new generation of protein database search programs Stephen F. Altschul · Nucleic Acids Research Open access Sep 1997 75,032
2 The Sequence Alignment/Map format and SAMtools Heng Li, Bob Handsaker, Alec Wysoker et al. · Bioinformatics Open access 8 Jun 2009 69,061
3 Fast and accurate short read alignment with Burrows–Wheeler transform Heng Li, Richard M. Durbin · Bioinformatics Open access 18 May 2009 63,989
4 Fast gapped-read alignment with Bowtie 2 Ben Langmead, Steven L. Salzberg · Nature Methods Open access 4 Mar 2012 62,825
5 XGBoost Tianqi Chen, Carlos Guestrin Conference paperOpen access 8 Aug 2016 53,418
All 99 most cited papers, with filters and sorting

Where is Algorithms and Data Compression research done?

The largest centres of Algorithms and Data Compression research in 2022-now are Beijing (China), Shanghai (China), Tokyo (Japan) and Paris (France). Among places with at least 20 works in it, it is an unusually large share of all research in Haifa and Pisa.

Largest cities, 2022-now

  1. 1 BeijingChina 138 works
  2. 2 ShanghaiChina 46 works
  3. 3 TokyoJapan 45 works
  4. 4 ParisFrance 45 works
  5. 5 SeoulSouth Korea 41 works
  6. 6 ShenzhenChina 39 works
  7. 7 GuangzhouChina 32 works
  8. 8 NanjingChina 31 works
  9. 9 MoscowRussia 31 works
  10. 10 ChennaiIndia 28 works

Where it is the local speciality

  1. HaifaIL · 23.1 works9.4×
  2. PisaIT · 20.9 works7.4×
← less than its size predicts1×more →

Location quotient: how much more of its research is in Algorithms and Data Compression than the world average.

See Algorithms and Data Compression on the map

Where is the best place to study Algorithms and Data Compression?

Among universities, judged by research, Tsinghua University, ETH Zurich and University of Illinois Urbana-Champaign score highest, combining excellence, specialisation, size, growth and international reach. Research strength is one signal when choosing where to study; it does not measure teaching.

0%20%40%mean 17.42%fractional works in this field (log) →share of work in the world top 10% →Tsinghua UniversityETH ZurichUniversity of Illino…Carnegie Mellon Univ…
above the meannear itbelow it

One dot per university in the first ten of the table below, at the default weights. The upper left is the interesting corner: small places doing unusually strong work.

Excellenceshare of its work in the world top 10%, 2022-now and all time averaged
40%
Specialisationhow much of its work is in this field, counted up to 10× the world share
10%
Sizeits output in this field, on a log scale
30%
Growthoutput growth, counted from -20% to +20%
10%
Internationalshare of its work with a co-author abroad
10%
Each slider sets a weight; the share it gets of the score is beside it.
#UniversityScoreTop 10%SpecialisationWorksGrowth
1Tsinghua UniversityChina 81.331.1%2.6×18 +52.7%
2ETH ZurichSwitzerland 78.230.6%5.9×12 +5.6%
3University of Illinois Urbana-ChampaignUnited States 67.812.2%6.1×16 +35.0%
4Carnegie Mellon UniversityUnited States 67.412.0%12.6×16 -57.1%
5Stanford UniversityUnited States 65.823.2%3.0×14 -19.3%
6University of HelsinkiFinland 64.78.8%7.7×16 -5.1%
7Technion – Israel Institute of TechnologyIsrael 64.011.3%13.8×16 +2.0%
8University of PisaItaly 63.811.3%10.3×15 +44.8%
9Massachusetts Institute of TechnologyUnited States 63.711.3%6.8×14 -3.5%
10Chinese University of Hong KongChina 63.122.4%3.9×9 +24.9%

Universities only. The score blends excellence (40%), size (30%), specialisation (10%), growth (10%), international reach (10%), 2022-now; growth compares 2018-21 with 2022-25 and counts up to +20%, since a jump from a small base is mostly noise.

Every institution in Algorithms and Data Compression, country by country

Is Algorithms and Data Compression research growing?

Output in 2022-2025 was 6% lower than in 2018-2021, peaking in 2002.

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 Algorithms and Data Compression as a percentage of every work published that year, 0.018% in 2024.

still counting0.050%0.10%0.15%Algorithms and Data Compression0.016% in 202519801990200020102020

Fractional works of Algorithms and Data Compression 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%Algorithms and Data Compression9.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 Algorithms and Data Compression. Posts are plain text and can be reported.