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 …

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 …

Alternative splicing (AS) is a widespread process underlying the generation of transcriptomic
and proteomic diversity and is frequently misregulated in human disease. Accordingly, an …

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 …

A succinct full-text self-index is a data structure built on a text T= t 1 t 2... tn, which takes little
space (ideally close to that of the compressed text), permits efficient search for the …

Motivation: The de novo assembly of large, complex genomes is a significant challenge with
currently available DNA sequencing technology. While many de novo assembly software …

Research on succinct data structures has made significant progress in recent years. An
essential building block of many of those techniques is a data structure to perform rank and …

The enormous complexity of biological systems at the molecular level must be answered
with powerful computational methods. Computational biology is a young field, but has seen …

We consider a generalization of the problem of supporting rank and select queries on binary
strings. Given a string of length n from an alphabet of size σ, we give the first representation …