13 citations · 26 across the 6 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
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…