A locally adaptive data compression scheme
Communications of the ACM
Data compression with finite windows
Communications of the ACM
Software—Practice & Experience
Text compression
A very fast substring search algorithm
Communications of the ACM
A new approach to text searching
Communications of the ACM
Data compression with factor automata
Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
Longest-match string searching for Ziv-Lempel compression
Software—Practice & Experience
Arithmetic coding for data compression
Communications of the ACM
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
A fast string searching algorithm
Communications of the ACM
Text-Retrieval: Theory and Practice
Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92, Volume 1 - Volume I
Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract)
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
COCOON '96 Proceedings of the Second Annual International Conference on Computing and Combinatorics
A Bit-Parallel Approach to Suffix Automata: Fast Extended String Matching
CPM '98 Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching
Shift-And Approach to Pattern Matching in LZW Compressed Text
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Algorithms on Compressed Strings and Arrays
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Approximate String Matching over Ziv-Lempel Compressed Text
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Boyer-Moore String Matching over Ziv-Lempel Compressed Text
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
A Boyer-Moore Type Algorithm for Compressed Pattern Matching
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Multiple Pattern Matching Algorithms on Collage System
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Speeding Up Pattern Matching by Text Compression
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Regular Expression Searching over Ziv-Lempel Compressed Text
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
DCC '00 Proceedings of the Conference on Data Compression
A New Compression Method for Compressed Matching
DCC '00 Proceedings of the Conference on Data Compression
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
Faster Approximate String Matching over Compressed Text
DCC '01 Proceedings of the Data Compression Conference
Compressed Pattern Matching for Sequitur
DCC '01 Proceedings of the Data Compression Conference
Compressed Pattern Matching in DNA Sequences
CSB '04 Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference
Optimal pattern matching in LZW compressed strings
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Space efficient deep packet inspection of compressed web traffic
Computer Communications
Improving time and space complexity for compressed pattern matching
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Accelerating multipattern matching on compressed HTTP traffic
IEEE/ACM Transactions on Networking (TON)
Fundamenta Informaticae - Computing Patterns in Strings
Processing compressed texts: a tractability border
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Optimal Pattern Matching in LZW Compressed Strings
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
Journal of Discrete Algorithms
| Hi-index | 0.00 |
We address the problem of string matching on Ziv-Lempel compressed text. The goal is to search a pattern in a text without uncompressing it. This is a highly relevant issue to keep compressed text databases where efficient searching is still possible. We develop a general technique for string matching when the text comes as a sequence of blocks. This abstracts the essential features of Ziv-Lempel compression. We then apply the scheme to each particular type of compression. We present the first algorithm to find all the matches of a pattern in a text compressed using LZ77. When we apply our scheme to LZ78, we obtain a much more efficient search algorithm, which is faster than uncompressing the text and then searching on it. Finally, we propose a new hybrid compression scheme which is between LZ77 and LZ78, being in practice as good to compress as LZ77 and as fast to search in as LZ78.