String matching in Lempel-Ziv compressed strings
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Let sleeping files lie: pattern matching in Z-compressed files
Journal of Computer and System Sciences
Robust universal complete codes for transmission and compression
Discrete Applied Mathematics
A text compression scheme that allows fast searching directly in the compressed file
ACM Transactions on Information Systems (TOIS)
Skeleton Trees for the Efficient Decoding of Huffman Encoded Texts
Information Retrieval
A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
A New Compression Method for Compressed Matching
DCC '00 Proceedings of the Conference on Data Compression
Pattern Matching in Huffman Encoded Texts
DCC '01 Proceedings of the Data Compression Conference
Faster Approximate String Matching over Compressed Text
DCC '01 Proceedings of the Data Compression Conference
Word Searching in CCITT Group 4 Compressed Document Images
ICDAR '03 Proceedings of the Seventh International Conference on Document Analysis and Recognition - Volume 1
LZ trie and dictionary compression
Software—Practice & Experience
Compressed data structures: Dictionaries and data-aware measures
Theoretical Computer Science
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
Compressed dictionaries: space measures, data sets, and experiments
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
| Hi-index | 0.00 |
The paradigm of compressed matching is extended to searching in dictionaries that have been compressed by the prefix omission technique, on which Huffman encoding is superimposed. A new variant is suggested based on the universal Fibonacci codes, which can have advantages for both time and space on small files.