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 …

High-throughput sequencing has revolutionised the field of biological sequence analysis. Its
application has enabled researchers to address important biological questions, often for the …

Self-indexes are able to represent a text asymptotically within the information-theoretic lower
bound under the k th order entropy model and offer access to any text substring and indexed …

The wavelet tree is a flexible data structure that permits representing sequences S [1, n] of
symbols over an alphabet of size σ, within compressed space and supporting a wide range …

Motivation: Low-cost genome sequencing gives unprecedented complete information about
the genetic structure of populations, and a population graph captures the variations between …

We show that the compressed suffix array and the compressed suffix tree for a string of
length n over an integer alphabet of size σ≤ n can both be built in O (n)(randomized) time …

The field of succinct data structures has flourished over the past 16 years. Starting from the
compressed suffix array by Grossi and Vitter (STOC 2000) and the FM-index by Ferragina …

Parallelism is the key to achieving high performance in computing. However, writing efficient
and scalable parallel programs is notoriously difficult, and often requires significant …

The median filter is a simple yet powerful noise reduction technique that is extensively
applied in image, signal, and speech processing. It can effectively remove impulsive noise …

The longest common prefix array is a very advantageous data structure that, combined with
the suffix array and the Burrows–Wheeler transform, allows to efficiently compute some …