Online LZ77 Parsing and Matching Statistics with RLBWTs
From MaRDI portal
Publication:5140769
DOI10.4230/LIPIcs.CPM.2018.7zbMath1497.68169OpenAlexW2964283928MaRDI QIDQ5140769
Travis Gagie, Itagaki Tomohiro, Hideo Bannai
Publication date: 16 December 2020
Full work available at URL: http://doi.org/10.4230/LIPIcs.CPM.2018.7
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 ⋮ Unnamed Item ⋮ Lempel-Ziv-like parsing in small space ⋮ A faster implementation of online RLBWT and its application to LZ77 parsing ⋮ Refining the \(r\)-index
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A faster implementation of online run-length Burrows-Wheeler transform
- RLZAP: relative Lempel-Ziv with adaptive pointers
- Algorithmics on SLP-compressed strings: A survey
- Relative Lempel-Ziv Compression of Genomes for Large-Scale Storage and Retrieval
- Indexing compressed text
- From LZ77 to the run-length encoded burrows-wheeler transform, and back
- Faster Compressed Suffix Trees for Repetitive Collections
This page was built for publication: Online LZ77 Parsing and Matching Statistics with RLBWTs