Online LZ77 parsing and matching statistics with RLBWTs
From MaRDI portal
Publication:5140769
Recommendations
- A faster implementation of online RLBWT and its application to LZ77 parsing
- LZ77 computation based on the run-length encoded BWT
- From LZ77 to the run-length encoded Burrows-Wheeler transform, and back
- Approximating LZ77 via Small-Space Multiple-Pattern Matching
- Lempel-Ziv-like parsing in small space
Cites work
- scientific article; zbMATH DE number 6850405 (Why is no real title available?)
- A faster implementation of online run-length Burrows-Wheeler transform
- Algorithmics on SLP-compressed strings: a survey
- Bioinformatics algorithms. Sequence analysis, genome rearrangements, and phylogenetic reconstruction
- Faster compressed suffix trees for repetitive collections
- From LZ77 to the run-length encoded Burrows-Wheeler transform, and back
- Indexing compressed text
- RLZAP: relative Lempel-Ziv with adaptive pointers
- Relative Lempel-Ziv compression of genomes for large-scale storage and retrieval
- Representing the suffix tree with the CDAWG
Cited in
(8)- Novel results on the number of runs of the Burrows-Wheeler-transform
- Comparison of LZ77-type parsings
- scientific article; zbMATH DE number 7651154 (Why is no real title available?)
- Lempel-Ziv-like parsing in small space
- Refining the \(r\)-index
- From LZ77 to the run-length encoded Burrows-Wheeler transform, and back
- A faster implementation of online RLBWT and its application to LZ77 parsing
- Rpair: rescaling RePair with Rsync
This page was built for publication: Online LZ77 parsing and matching statistics with RLBWTs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5140769)
