Evidence map›Paper›PMID 42732223›Full record

ArticleTheory of computing systems2026

Suffixient Arrays: A New Efficient Suffix Array Compression Technique.

Davide Cenzato, Lore Depuydt, Travis Gagie, Sung-Hwan Kim, Giovanni Manzini, Francisco Olivares, Nicola Prezza

Abstract read
PubMed Full text at PMC Publisher
In one paragraph

Article in Theory of computing systems, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

7 authors.

Davide CenzatoDAIS, Ca' Foscari University of Venice, Venice, Italy.
Lore DepuydtDepartment of Information Technology - IDLab, Ghent University - imec, Ghent, Belgium.
Travis GagieFaculty of Computer Science, Dalhousie University, 6050 University Ave., Halifax, B3H 1W5 Nova Scotia Canada.
Sung-Hwan KimDAIS, Ca' Foscari University of Venice, Venice, Italy.
Giovanni ManziniComputer Science Dept., University of Pisa, Pisa, Italy.
Francisco OlivaresDepartment of Computer Science, University of Chile, Santiago, Chile.
Nicola PrezzaDAIS, Ca' Foscari University of Venice, Venice, Italy.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The Suffix Array is a classic text index enabling on-line pattern matching queries via simple binary search. The main drawback of the Suffix Array is that it takes linear space in the text's length, even when the text itself is extremely compressible. Several works in the literature showed that the Suffix Array can be compressed, but they all rely on complex succinct data structures which in practice tend to exhibit poor cache locality and thus significantly slow down queries. In this paper, we propose a new simple and very efficient solution to this problem by presenting the

Indexed as

Compressed-space algorithmsMaximal exact matchRight-maximal substringSuffixient setText indexing

Identifiers

PMID42732223
PMCPMC13569561

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.