Document retrieval is one of the best-established information retrieval activities since
the'60s, pervading all search engines. Its aim is to obtain, from a collection of text …

Lately, there has been an upsurge of interest in compressed data structures, aiming to pack
ever larger quantities of information into constrained memory without sacrificing the …

Succinct data structures provide the same functionality as their corresponding traditional
data structure in compact space. We improve on functions rank and select, which are the …

In this paper we describe algorithms for computing the Burrows-Wheeler Transform (bwt)
and for building (compressed) indexes in external memory. The innovative feature of our …

The combination of incessant advances in sequencing technology producing large amounts
of data and innovative bioinformatics approaches, designed to cope with this data flood, has …

Navarro, Gonzalo.“Wavelet trees for all,” In Proc. of the Sympo sium on Combinatorial
Pattern Matching (CPM), vol. 7354 of Lecture Notes in Computer Science, pp. 2-26 …

The wavelet tree data structure is a space-efficient technique for rank and select queries that
generalizes from binary characters to an arbitrary multicharacter alphabet. It has become a …

The topic of this paper is the exploration of the various characteristics of the wavelet tree
data structure, a data structure that was initially proposed for text compression applications …

Let D be a given set of (string) documents of total length n. The top-k document retrieval
problem is to index D such that when a pattern P of length p, and a parameter k come as a …

The suffix array is an efficient data structure for in-memory pattern search. Suffix arrays can
also be used for external-memory pattern search, via two-level structures that use an internal …