Trans-dichotomous algorithms for minimum spanning trees and shortest paths
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
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
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
A fast string searching algorithm
Communications of the ACM
String Matching Algorithms and Automata
Proceedings of the Colloquium in Honor of Arto Salomaa on Results and Trends in Theoretical Computer Science
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Pattern Matching in Compressed Texts
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Saving Comparisons in the Crochemore-Perrin String Matching Algorithm
ESA '93 Proceedings of the First Annual European Symposium on Algorithms
Almost Optimal Fully LZW-Compressed Pattern Matching
DCC '99 Proceedings of the Conference on Data Compression
Optimal suffix tree construction with large alphabets
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Time-space-optimal string matching (Preliminary Report)
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Algorithms on Strings
Pattern matching in lempel-Ziv compressed strings: fast, simple, and deterministic
ESA'11 Proceedings of the 19th European conference on Algorithms
Faster fully compressed pattern matching by recompression
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Simple and efficient LZW-Compressed multiple pattern matching
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Efficient LZ78 factorization of grammar compressed text
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
| Hi-index | 0.00 |
We consider the following variant of the classical pattern matching problem: given an uncompressed pattern s[1..m] and a compressed representation of a string t[1..N], does s occur in t? When t is compressed using the LZW method, we are able to detect the occurrence in optimal linear time, thus answering a question of Amir, Benson, and Farach [2]. Previous results implied solutions with complexities O(n log m + m) [2], O(n + m1+ε) [14], or (randomized) O(n log N/n + m) [8], where n is the size of the compressed representation of t. Our algorithm is simple and fully deterministic.