Efficient LZ78 Factorization of Grammar Compressed Text
From MaRDI portal
Publication:4913725
DOI10.1007/978-3-642-34109-0_10zbMath1381.68310arXiv1207.4607OpenAlexW2142177367MaRDI QIDQ4913725
Masayuki Takeda, Shunsuke Inenaga, Hideo Bannai
Publication date: 8 April 2013
Published in: String Processing and Information Retrieval (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1207.4607
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Grammars and rewriting systems (68Q42) Data structures (68P05) Algorithms on strings (68W32)
Related Items (7)
Lempel Ziv Computation in Small Space (LZ-CISS) ⋮ LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding ⋮ Engineering Practical Lempel-Ziv Tries ⋮ Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries ⋮ Unnamed Item ⋮ LZ77 computation based on the run-length encoded BWT ⋮ Constructing LZ78 tries and position heaps in linear time for large alphabets
This page was built for publication: Efficient LZ78 Factorization of Grammar Compressed Text