Dictionary-Symbolwise Flexible Parsing
From MaRDI portal
Publication:3000525
DOI10.1007/978-3-642-19222-7_38zbMath1326.68131OpenAlexW2179977323MaRDI QIDQ3000525
Alessio Langiu, Filippo Mignosi, Laura Giambruno, Maxime Crochemore, Antonio Restivo
Publication date: 19 May 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.392.8710
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)
Related Items (4)
On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case ⋮ On optimal parsing for LZ78-like compressors ⋮ Note on the greedy parsing optimality for dictionary-based text compression ⋮ Dictionary-symbolwise flexible parsing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the Bit-Complexity of Lempel--Ziv Compression
- Data compression via textual substitution
- An analysis of the longest match and the greedy heuristics in text encoding
- The relationship between greedy parsing and symbolwise text compression
- The Effect of Flexible Parsing for Dynamic Dictionary-Based Data Compression
This page was built for publication: Dictionary-Symbolwise Flexible Parsing
