Dictionary-symbolwise flexible parsing
DOI10.1016/j.jda.2011.12.021zbMath1252.68099OpenAlexW2004967805MaRDI QIDQ450551
Antonio Restivo, Maxime Crochemore, Alessio Langiu, Laura Giambruno, Filippo Mignosi
Publication date: 13 September 2012
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2011.12.021
directed acyclic graphtext compressionstringologydictionary-based compressionoptimal parsingsymbolwise text compression
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information storage and retrieval of data (68P20) Algorithms on strings (68W32)
Related Items (6)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing longest previous factor in linear time and applications
- The Erdős-Rényi strong law for pattern matching with a given proportion of mismatches
- Special issue: Average-case analysis of algorithms
- Languages with mismatches
- Dictionary-Symbolwise Flexible Parsing
- On the Suffix Automaton with Mismatches
- 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
- Compression of Low Entropy Strings with Lempel--Ziv Algorithms
- The Effect of Flexible Parsing for Dynamic Dictionary-Based Data Compression
- Developments in Language Theory
This page was built for publication: Dictionary-symbolwise flexible parsing