Two decades ago, a breakthrough in indexing string collections made it possible to
represent them within their compressed space while at the same time offering indexed …

Full-text indexes provide fast substring search over large text collections. A serious problem
of these indexes has traditionally been their space consumption. A recent trend is to develop …

Indexing highly repetitive texts—such as genomic databases, software repositories and
versioned text collections—has become an important problem since the turn of the …

We address the issue of compressing and indexing data. We devise a data structure whose
space occupancy is a function of the entropy of the underlying data set. We call the data …

We design two compressed data structures for the full-text indexing problem that support
efficient substring searches using roughly the space required for storing the text in …

This paper is concerned with algorithms for prediction of discrete sequences over a finite
alphabet, using variable order Markov models. The class of such algorithms is large and in …

We propose new succinct representations of ordinal trees and match various space/time
lower bounds. It is known that any n-node static tree can be represented in 2 n+ o (n) bits so …

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 …

Given a sequence S= s 1 s 2… sn of integers smaller than r= O (polylog (n)), we show how S
can be represented using nH 0 (S)+ o (n) bits, so that we can know any sq, as well as …

Given a static array of n totally ordered objects, the range minimum query problem is to build
a data structure that allows us to answer efficiently subsequent on-line queries of the form …