activity
20152019
most citedComposite repetition-aware data structures

13 citations · 26 across the 6 of their papers we have counts for

collaborators

8 papers

cs.DS2019

Fully-functional bidirectional Burrows-Wheeler indexes

Fabio Cunial, Djamal Belazzougui

Given a string on an alphabet of size , we describe a bidirectional Burrows-Wheeler index that takes bits of space, and that supports the addition \emph{and re…

cs.DS2017

Fast Label Extraction in the CDAWG

Djamal Belazzougui, Fabio Cunial

The compact directed acyclic word graph (CDAWG) of a string of length takes space proportional just to the number of right extensions of the maximal repeats of , and…

cs.DS2017★ 7 cited

Representing the suffix tree with the CDAWG

Djamal Belazzougui, Fabio Cunial

Given a string , it is known that its suffix tree can be represented using the compact directed acyclic word graph (CDAWG) with arcs, taking overall $O(e_T+e_{\overline{T}…

cs.DS2016

Linear-time string indexing and analysis in small space

Djamal Belazzougui, Fabio Cunial, Juha Kärkkäinen +1

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

cs.DS2016★ 2 cited

Practical combinations of repetition-aware data structures

Djamal Belazzougui, Fabio Cunial, Travis Gagie +2

Highly-repetitive collections of strings are increasingly being amassed by genome sequencing and genetic variation experiments, as well as by storing all versions of human-generate…

cs.DS2015★ 1 cited

Space-efficient detection of unusual words

Djamal Belazzougui, Fabio Cunial

Detecting all the strings that occur in a text more frequently or less frequently than expected according to an IID or a Markov model is a basic problem in string mining, yet curre…

cs.DS2015★ 3 cited

A framework for space-efficient string kernels

Djamal Belazzougui, Fabio Cunial

String kernels are typically used to compare genome-scale sequences whose length makes alignment impractical, yet their computation is based on data structures that are either spac…

cs.DS2015★ 13 cited

Composite repetition-aware data structures

Djamal Belazzougui, Fabio Cunial, Travis Gagie +2

In highly repetitive strings, like collections of genomes from the same species, distinct measures of repetition all grow sublinearly in the length of the text, and indexes targete…