Engineering efficient implementations of compact and succinct structures is time-consuming
and challenging, since there is no standard library of easy-to-use, highly optimized, and …

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 …

Motivation: Second-generation sequencing technology makes it feasible for many
researches to obtain enough sequence reads to attempt the de novo assembly of higher …

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 …

Motivation: Storing, transferring and maintaining genomic databases becomes a major
challenge because of the rapid technology progress in DNA sequencing and …

Rank and select queries on bitmaps are fundamental for the construction of a variety of
compact data structures. Both can, in theory, be answered in constant time by spending o (n) …

We address the problem of designing, implementing, and experimenting with compressed
data structures that support rank and select queries over a dictionary of integers. We shine a …

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 …

Enormous databases of short-read RNA-seq experiments such as the NIH Sequencing
Read Archive are now available. These databases could answer many questions about …

Conjunctive Boolean queries are a key component of modern information retrieval systems,
especially when Web-scale repositories are being searched. A conjunctive query q is …