Straight-line programs: a practical test (extended abstract)

DOI10.1007/S10958-013-1394-6zbMath1276.68068OpenAlexW1974927362MaRDI 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

zbMATH Keywords

context-free grammarsstraight-line programscomressed datahuge data setsLempel-Ziv algorithm

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Grammars and rewriting systems (68Q42)

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

This page was built for publication: Straight-line programs: a practical test (extended abstract)