In this paper, we show that the LZ77 factorization of a text T ε Σ n can be computed in O(R log n) bits of working space and O(n log R) time, R being the number of runs in the Burrows-Wheeler transform of T (reversed). For (extremely) repetitive inputs, the working space can be as low as O(log n) bits: exponentially smaller than the text itself. Hence, our result finds important applications in the construction of repetition-aware self-indexes and in the compression of repetitive text collections within small working space.
Computing LZ77 in Run-Compressed Space / Policriti, Alberto; Prezza, Nicola. - Data Compression Conference Proceedings, (2016), pp. 23-32. (Data Compression Conference 2016, Snowbird, Utah, March 29 - April 1, 2016). [10.1109/DCC.2016.30].
Computing LZ77 in Run-Compressed Space
PREZZA, Nicola
2016
Abstract
In this paper, we show that the LZ77 factorization of a text T ε Σ n can be computed in O(R log n) bits of working space and O(n log R) time, R being the number of runs in the Burrows-Wheeler transform of T (reversed). For (extremely) repetitive inputs, the working space can be as low as O(log n) bits: exponentially smaller than the text itself. Hence, our result finds important applications in the construction of repetition-aware self-indexes and in the compression of repetitive text collections within small working space.
| File | Dimensione | Formato | |
|---|---|---|---|
|
rle-lz77.pdf
Solo gestori archivio
Tipologia:
Documento in Pre-print
Licenza:
DRM (Digital rights management) non definiti
Dimensione
250.33 kB
Formato
Adobe PDF
|
250.33 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
