Compressed full-text indexes

773 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

A taxonomy of suffix array construction algorithms (2007, methodology): “For example, algorithms and techniques such as those discussed in [Grossi and Vitter 2005; Mäkinen and Navarro 2006] and references therein are not covered.”
Parallel Lightweight Wavelet Tree, Suffix Array and FM-Index Construction (2016, background): “In recent years, compressed full-text indexes [23] have become popular as they provide an elegant way of compressing data while at the same time supporting queries on it efficiently.”
The Algorithm Design Manual (2020, background): “Navarro and Raffinot [NR07] is the best reference on these techniques, which are also treated in other books on string algorithmics [CHL07, Gus97].”
Computational pan-genomics: status, promises and challenges (2016, background): “Efficient data structures for prefix sum, rank and select queries exist [97], which can be used for doing projections to and from a sequence and its gapped version as a row of an MSA.”