3 papers
cs.DS2026
Adaptive encodings for small and fast compressed suffix arrays
Diego DÃaz-DomÃnguez, Veli Mäkinen
Compressed suffix arrays (CSAs) index large repetitive collections and are key in many text applications. The r-index and its derivatives combine the run-length Burrows-Wheeler Tra…
cs.DS2025
Prefix-free parsing for merging big BWTs
Diego Diaz-Dominguez, Travis Gagie, Veronica Guerrini +5
When building Burrows-Wheeler Transforms (BWTs) of truly huge datasets, prefix-free parsing (PFP) can use an unreasonable amount of memory. In this paper we show how if a dataset c…
cs.DS2025
Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing
Diego Diaz-Dominguez
We present a highly parallelizable text compression algorithm that scales efficiently to terabyte-sized datasets. Our method builds on locally consistent grammars, a lightweight fo…