Recommendations
- From LZ77 to the run-length encoded Burrows-Wheeler transform, and back
- LZ77 computation based on the run-length encoded BWT
- Online LZ77 parsing and matching statistics with RLBWTs
- A faster implementation of online RLBWT and its application to LZ77 parsing
- Converting SLP to LZ78 in almost Linear Time
Cites work
- A \textit{really} simple approximation of smallest grammar
- A faster implementation of online RLBWT and its application to LZ77 parsing
- Alphabet-dependent string searching with wexponential search trees
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- Converting SLP to LZ78 in almost Linear Time
- Dynamic relative compression, dynamic partial sums, and substring concatenation
- Efficient LZ78 factorization of grammar compressed text
- scientific article; zbMATH DE number 2038766 (Why is no real title available?)
- scientific article; zbMATH DE number 6850405 (Why is no real title available?)
- Log-logarithmic worst-case range queries are possible in space theta(N)
- LZ77 computation based on the run-length encoded BWT
- On the Complexity of Finite Sequences
- Optimal bounds for the predecessor problem and related problems
- Optimal construction of compressed indexes for highly repetitive texts
- Space-efficient preprocessing schemes for range minimum queries on static arrays
- Succinct data structures for searchable partial sums with optimal worst-case performance
- Suffix Arrays: A New Method for On-Line String Searches
Cited in
(4)
This page was built for publication: Conversion from RLBWT to LZ77
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088897)
