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 …

Compact data structures help represent data in reduced space while allowing it to be
queried, navigated, and operated in compressed form. They are essential tools for efficiently …

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 central problem in computational geometry, range searching arises in many applications,
and a variety of geometric problems can be formulated as range-searching problems. A …

The predecessor problem is a key component of the fundamental sorting-and-searching
core of algorithmic problems. While binary search is the optimal solution in the comparison …

Multitask learning has proven to be useful in the field of machine learning when additional
knowledge is available to help a prediction task. We adapt this paradigm to develop …

We describe the first self-indexes able to count and locate pattern occurrences in optimal
time within a space bounded by the size of the most popular dictionary compressors. To …

To store and search genomic databases efficiently, researchers have recently started
building compressed self-indexes based on straight-line programs and LZ77. In this paper …

Motivated by fundamental applications in databases and relational machine learning, we
formulate and study the problem of answering functional aggregate queries (FAQ) in which …

To store and search genomic databases efficiently, researchers have recently started
building self-indexes based on LZ77. As the name suggests, a self-index for a string …