Compressed matching in dictionaries
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2185629 (Why is no real title available?)
- scientific article; zbMATH DE number 2185642 (Why is no real title available?)
- scientific article; zbMATH DE number 1263249 (Why is no real title available?)
- scientific article; zbMATH DE number 1445301 (Why is no real title available?)
- Compressed matching in dictionaries
- Improving table compression with combinatorial optimization
- Let sleeping files lie: Pattern matching in Z-compressed files.
- Pattern matching in Huffman encoded texts
- Robust universal complete codes for transmission and compression
- \((s,c)\)-dense coding: an optimized compression code for natural language text databases.
Cited in
(17)- Compressed matching in dictionaries
- Succinct 2D dictionary matching
- MODELING DELTA ENCODING OF COMPRESSED FILES
- scientific article; zbMATH DE number 2088760 (Why is no real title available?)
- Pattern matching in Huffman encoded texts
- Succinct Dictionary Matching with No Slowdown
- Bidirectional adaptive compression
- Unification and matching on compressed terms
- Forward looking Huffman coding
- The structural border array
- String matching over compressed text on handheld devices using tagged sub-optimal code (TSC)
- Direct merging of delta encoded files
- Small-Space 2D Compressed Dictionary Matching
- Compressed parameterized pattern matching
- A new compression method of double array for compact dictionaries
- Compressing dictionary matching index via sparsification technique
- scientific article; zbMATH DE number 1946603 (Why is no real title available?)
This page was built for publication: Compressed matching in dictionaries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736479)