Space-efficient conversions from SLPs

Cites work

scientific article; zbMATH DE number 1512678 (Why is no real title available?)
scientific article; zbMATH DE number 6850408 (Why is no real title available?)
scientific article; zbMATH DE number 1445383 (Why is no real title available?)
A Functional Approach to Data Structures and Its Use in Multidimensional Searching
Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
At the roots of dictionary compression: string attractors
Balancing Straight-line Programs
Dynamic index and LZ factorization in compressed space
Efficient randomized pattern-matching algorithms
Fast prefix search in little space, with applications
From LZ77 to the run-length encoded Burrows-Wheeler transform, and back
Fully functional suffix trees and optimal text searching in BWT-runs bounded space
Grammar-based codes: a new class of universal lossless source codes
Grammar-compressed indexes with logarithmic search time
Linear work suffix array construction
Longest common extensions with recompression
Maintaining dynamic sequences under equality tests in polylogarithmic time
On the Approximation Ratio of Ordered Parsings
On the Complexity of Finite Sequences
Optimal-Time Dictionary-Compressed Indexes
Optimally computing compressed indexing arrays based on the compact directed acyclic word graph
Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and Deterministic
Random access to grammar-compressed strings and trees
Range predecessor and Lempel-Ziv parsing
Sparse suffix tree construction in optimal time and space
The Smallest Grammar Problem
Toward a Definitive Compressibility Measure for Repetitive Sequences
Universal compressed text indexing
Wavelet trees for all

This page was built for publication: Space-efficient conversions from SLPs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547925)