Efficient algorithms for Lempel-Ziv encoding
From MaRDI portal
Recommendations
- Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and Deterministic
- scientific article; zbMATH DE number 1263249
- Approximate string matching on Ziv--Lempel compressed text
- scientific article; zbMATH DE number 1408351
- Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts
Cites work
- A universal algorithm for sequential data compression
- scientific article; zbMATH DE number 1003304 (Why is no real title available?)
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1263249 (Why is no real title available?)
- scientific article; zbMATH DE number 801745 (Why is no real title available?)
- On the Complexity of Finite Sequences
- Optimal parallel algorithms for periods, palindromes and squares (extended abstract)
- Optimal two-dimensional compressed matching
Cited in
(35)- Efficient algorithms to compute compressed longest common substrings and compressed palindromes
- The complexity of compressing subsegments of images described by finite automata
- On the complexity of pattern matching for highly compressed two-dimensional texts.
- Collage system: A unifying framework for compressed pattern matching.
- On stricter reachable repetitiveness measures
- Computing longest palindromic substring after single-character or block-wise edits
- The complexity of compressed membership problems for finite automata
- Compressed automata for dictionary matching
- Tree compression with top trees
- A PTIME-complete matching problem for SLP-compressed words
- Equality Testing of Compressed Strings
- Processing Compressed Texts: A Tractability Border
- A note on the Ziv - Lempel model for compressing individual sequences (Corresp.)
- Improved variations relating the Ziv-Lempel and Welch-type algorithms for sequential data compression
- scientific article; zbMATH DE number 1223734 (Why is no real title available?)
- Efficient retrieval of approximate palindromes in a run-length encoded string
- An implementable lossy version of the Lempel-Ziv algorithm. I. Optimality for memoryless sources
- An efficient algorithm to test square-freeness of strings compressed by straight-line programs
- Polynomial braid combing
- On the universality of the LZ-based decoding algorithm
- Improved redundancy of a version of the Lempel-Ziv algorithm
- scientific article; zbMATH DE number 1408351 (Why is no real title available?)
- Approximation of grammar-based compression via recompression
- Pattern-matching problems for 2-dimensional images described by finite automata
- Engineering practical Lempel-Ziv tries
- Longest substring palindrome after edit
- Computing Longest Common Substring and All Palindromes from Compressed Strings
- Leaf languages and string compression
- Recognizing string graphs in NP
- Tracing compressed curves in triangulated surfaces
- The fully compressed subgroup membership problem
- Data structures for computing unique palindromes in static and non-static strings
- Repetitiveness measures based on string morphisms
- LZ77 computation based on the run-length encoded BWT
- A \textit{really} simple approximation of smallest grammar
This page was built for publication: Efficient algorithms for Lempel-Ziv encoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5054830)
