Compression of concordances in full-text retrieval systems
SIGIR '88 Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval
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
A text compression scheme that allows fast searching directly in the compressed file
ACM Transactions on Information Systems (TOIS)
Fast searching on compressed text allowing errors
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
Data compression via textual substitution
Journal of the ACM (JACM)
Shift-And Approach to Pattern Matching in LZW Compressed Text
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Contour extraction of compressed JPEG images
Journal of Graphics Tools
Searching in Compressed Dictionaries
DCC '02 Proceedings of the Data Compression Conference
Pattern Matching in Huffman Encoded Texts
DCC '01 Proceedings of the Data Compression Conference
Pattern matching in Huffman encoded texts
Information Processing and Management: an International Journal
LZgrep: a Boyer–Moore string matching tool for Ziv–Lempel compressed text: Research Articles
Software—Practice & Experience
Adapting the Knuth-Morris-Pratt algorithm for pattern matching in Huffman encoded texts
Information Processing and Management: an International Journal
Adapting the Knuth-Morris-Pratt algorithm for pattern matching in Huffman encoded texts
Information Processing and Management: an International Journal
Space efficient deep packet inspection of compressed web traffic
Computer Communications
Accelerating multipattern matching on compressed HTTP traffic
IEEE/ACM Transactions on Networking (TON)
Practical fixed length Lempel-Ziv coding
Discrete Applied Mathematics
| Hi-index | 0.00 |
A practical adaptive compression algorithm based on LZSS is presented, which is especially constructed to solve the compressed pattern-matching problem, i.e., pattern matching directly in a compressed text without decompressing.