13 citations · 23 across the 4 of their papers we have counts for
6 papers
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…
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…
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}…
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…
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…
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…