From LZ77 to the run-length encoded burrows-wheeler transform, and back

DOI10.4230/LIPICS.CPM.2017.17zbMath1434.68155arXiv1702.01340OpenAlexW2964060498MaRDI QIDQ5110881

Alberto Policriti, Nicola Prezza

Publication date: 25 May 2020

Full work available at URL: https://arxiv.org/abs/1702.01340

zbMATH Keywords

Burrows-Wheeler transformLempel-Zivrepetitive text collectionscompressed computation

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)

Related Items (5)

Novel results on the number of runs of the Burrows-Wheeler-transform ⋮ Refining the \(r\)-index ⋮ Prefix-Free Parsing for Building Big BWTs ⋮ Faster online computation of the succinct longest previous factor array ⋮ Online LZ77 Parsing and Matching Statistics with RLBWTs

This page was built for publication: From LZ77 to the run-length encoded burrows-wheeler transform, and back