A general compression algorithm that supports fast searching
From MaRDI portal
Cites work
- \((s,c)\)-dense coding: an optimized compression code for natural language text databases.
- An efficient compression code for text databases
- Boyer-Moore string matching over Ziv-Lempel compressed text
- Efficient string matching
- scientific article; zbMATH DE number 1754502 (Why is no real title available?)
- scientific article; zbMATH DE number 742992 (Why is no real title available?)
- Multiple approximate string matching
- Pattern matching in Huffman encoded texts
- Processing of Huffman compressed texts with a super-alphabet.
- Shift-And approach to pattern matching in LZW compressed text
- Shift-or string matching with super-alphabets
- String matching with stopper encoding and code splitting
Cited in
(2)
This page was built for publication: A general compression algorithm that supports fast searching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845872)