The wavelet tree is a versatile data structure that serves a number of purposes, from string
processing to computational geometry. It can be regarded as a device that represents a …

A compressed full-text self-index represents a text in a compressed form and still answers
queries efficiently. This represents a significant advancement over the (full-) text indexing …

We present a new variable-length encoding scheme for sequences of integers, Directly
Addressable Codes (DACs), which enables direct access to any element of the encoded …

We present a practical study on the compact representation of sequences supporting rank,
select, and access queries. While there are several theoretical solutions to the problem, only …

We describe a data structure that supports access, rank, and select queries, as well as
symbol insertions and deletions, on a string S 1, n over alphabet 1..σ in time …

The new opportunities generated by the data-driven economy in the manufacturing industry
have caused many companies opt for it. However, the size of time series data that need to …

Dictionary-based compression schemes provide fast decoding operation, typically at the
expense of reduced compression effectiveness compared to statistical or probability-based …

Compact data structures are storage structures that combine a compressed representation
of the data and the access mechanisms for retrieving individual data without the need of …

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 …

Nowadays we know how to effectively compress most basic components of any modern
search engine, such as, the graphs arising from the Web structure and/or its usage, the …