4 citations · 4 across the 1 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2017
The Compressed Overlap Index
Rodrigo Canovas, Bastien Cazaux, Eric Rivals
For analysing text algorithms, for computing superstrings, or for testing random number generators, one needs to compute all overlaps between any pairs of words in a given set. The…
cs.DS2011★ 4 cited
Compressed String Dictionaries
Nieves R. Brisaboa, Rodrigo Cánovas, Miguel A. Martínez-Prieto +1
The problem of storing a set of strings --- a string dictionary --- in compact form appears naturally in many cases. While classically it has represented a small part of the whole…