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 …

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 …

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 …

Variation graphs, which represent genetic variation within a population, are replacing
sequences as reference genomes. Path indexes are one of the most important tools for …

This article provides a comprehensive description of text analytics directly on compression
(TADOC), which enables direct document analytics on compressed textual data. The article …

Wavelet trees are widely used in the representation of sequences, permutations, text
collections, binary relations, discrete points, and other succinct data structures. We show …

We propose new succinct representations of ordinal trees, which have been studied
extensively. It is known that any n-node static tree can be represented in 2 n+ o (n) bits and a …

We show that the compressed suffix array and the compressed suffix tree of a string T can be
built in O (n) deterministic time using O (n log σ) bits of space, where n is the string length …

Suffix trees are among the most important data structures in stringology, with a number of
applications in flourishing areas like bioinformatics. Their main problem is space usage …

We describe a data structure that uses O (n)-word space and reports k most relevant
documents that contain a query pattern P in optimal O (| P|+ k) time. Our construction …