43 citations · 93 across the 20 of their papers we have counts for
3 papers · 1 filter
Faster run-length compressed suffix arrays
Nathaniel K. Brown, Travis Gagie, Giovanni Manzini +2
We first review how we can store a run-length compressed suffix array (RLCSA) for a text of length over an alphabet of size whose Burrows-Wheeler Transform (BWT) consis…
Exploring Repetitiveness Measures for Two-Dimensional Strings
Giuseppe Romana, Marinella Sciortino, Cristian Urbina
Detecting and measuring repetitiveness of strings is a problem that has been extensively studied in data compression and text indexing. However, when the data are structured in a n…
Bit catastrophes for the Burrows-Wheeler Transform
Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták +3
A bit catastrophe, loosely defined, is when a change in just one character of a string causes a significant change in the size of the compressed string. We study this phenomenon fo…