Space-efficient conversions from SLPs

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
Faster Fully Compressed Pattern Matching by Recompression
Linear work suffix array construction
Fast Prefix Search in Little Space, with Applications
Maintaining dynamic sequences under equality tests in polylogarithmic time
Efficient randomized pattern-matching algorithms
On the Complexity of Finite Sequences
Wavelet trees for all
A Functional Approach to Data Structures and Its Use in Multidimensional Searching
Longest Common Extensions with Recompression.
The Smallest Grammar Problem
Grammar-based codes: a new class of universal lossless source codes
Optimal-Time Dictionary-Compressed Indexes
Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and Deterministic
Range Predecessor and Lempel-Ziv Parsing
From LZ77 to the run-length encoded burrows-wheeler transform, and back
Random Access to Grammar-Compressed Strings and Trees
Universal compressed text indexing
Balancing Straight-line Programs
At the roots of dictionary compression: string attractors
Sparse Suffix Tree Construction in Optimal Time and Space
Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space
Dynamic index and LZ factorization in compressed space
Fingerprints in compressed strings
Grammar-compressed indexes with logarithmic search time
On the Approximation Ratio of Ordered Parsings
Toward a Definitive Compressibility Measure for Repetitive Sequences
Optimally computing compressed indexing arrays based on the compact directed acyclic word graph

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)