LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding

DOI10.1007/978-3-319-19929-0_19zbMath1432.68141OpenAlexW2161486961MaRDI QIDQ2942259

Masayuki Takeda, Shunsuke Inenaga, Hideo Bannai, Keisuke Goto

Publication date: 20 August 2015

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19929-0_19

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)

Related Items (6)

On the approximation ratio of LZ-end to LZ77 ⋮ Dynamic Path-decomposed Tries ⋮ On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation ⋮ Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing ⋮ Finger search in grammar-compressed strings ⋮ A Space-Optimal Grammar Compression.

Cites Work

• Unnamed Item
• An online algorithm for lightweight grammar-based compression
• Improved dynamic dictionary matching
• On-line construction of suffix trees
• Unified compression-based acceleration of edit-distance computation
• Speeding Up q-Gram Mining on Grammar-Based Compressed Texts
• Self-Indexed Grammar-Based Compression
• Compression of individual sequences via variable-rate coding
• Efficient LZ78 Factorization of Grammar Compressed Text
• Fast incremental planarity testing

This page was built for publication: LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding