Straight-line programs: a practical test (extended abstract)
From MaRDI portal
Publication:376125
DOI10.1007/s10958-013-1394-6zbMath1276.68068MaRDI QIDQ376125
A. V. Kozlova, I. S. Burmistrov, A. A. Khvorost, E. B. Kurpilyansky
Publication date: 4 November 2013
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10995/27423
68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
68Q42: Grammars and rewriting systems
Cites Work
- Unnamed Item
- Unnamed Item
- Faster subsequence recognition in compressed strings
- Matching for run-length encoded strings
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- Collage system: A unifying framework for compressed pattern matching.
- Randomized search trees
- Processing Compressed Texts: A Tractability Border
- The Smallest Grammar Problem
- A universal algorithm for sequential data compression
- Compression of individual sequences via variable-rate coding
- Computing Longest Common Substring and All Palindromes from Compressed Strings