Compressed matching in dictionaries
From MaRDI portal
Publication:1736479
DOI10.3390/a4010061zbMath1461.68079OpenAlexW1998827944MaRDI QIDQ1736479
Publication date: 26 March 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a4010061
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)
The structural border array ⋮ Compressed parameterized pattern matching ⋮ Bidirectional adaptive compression ⋮ Compressed matching in dictionaries ⋮ Forward looking Huffman coding ⋮ Direct merging of delta encoded files
Uses Software
Cites Work
- Let sleeping files lie: Pattern matching in Z-compressed files.
- Compressed matching in dictionaries
- Robust universal complete codes for transmission and compression
- Pattern matching in Huffman encoded texts
- Improving table compression with combinatorial optimization
- String Processing and Information Retrieval
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Compressed matching in dictionaries