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 …

Various graphs such as web or social networks may contain up to trillions of edges.
Compressing such datasets can accelerate graph processing by reducing the amount of I/O …

We present the first learned index that supports predecessor, range queries and updates
within provably efficient time and space bounds in the worst case. In the (static) context of …

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 …

Motivation: Shotgun sequence read data derived from xenograft material contains a mixture
of reads arising from the host and reads arising from the graft. Classifying the read mixture to …

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 …

We propose a new succinct de Bruijn graph representation. If the de Bruijn graph of k-mers
in a DNA sequence of length N has m edges, it can be represented in 4 m+ o (m) bits. This is …

The current genomic revolution was made possible by joint advances in genome
sequencing technologies and computational approaches for analyzing sequence data. The …

Abstract Motivation In 2012, Iqbal et al. introduced the colored de Bruijn graph, a variant of
the classic de Bruijn graph, which is aimed at 'detecting and genotyping simple and complex …

We introduce LZ-End, a new member of the Lempel–Ziv family of text compressors, which
achieves compression ratios close to those of LZ77 but is much faster at extracting arbitrary …