Matching patterns in strings subject to multi-linear transformations
Theoretical Computer Science
Two-dimensional periodicity and its applications
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Efficient pattern matching with scaling
Journal of Algorithms
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
Optimal two-dimensional compressed matching
Journal of Algorithms
Fast searching on compressed text allowing errors
Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Minimal Forbidden Words and Factor Automata
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract)
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
A Text Compression Scheme That Allows Fast Searching Directly in the Compressed File
CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
An Improved Pattern Matching Algorithm for Strings in Terms of Straight-Line Programs
CPM '97 Proceedings of the 8th 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
Multiple Pattern Matching in LZW Compressed Text
DCC '98 Proceedings of the Conference on Data Compression
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
A Boyer-Moore Type Algorithm for Compressed Pattern Matching
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Pattern Matching in DCA Coded Text
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Faster fully compressed pattern matching by recompression
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Fast Data Compression with Antidictionaries
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Fundamenta Informaticae - Computing Patterns in Strings
| Hi-index | 0.00 |
In this paper we focus on the problem of compressed pattern matching for the text compression using antidictionaries, which is a new compression scheme proposed recently by Crochemore et al. (1998). We show an algorithm which preprocesses a pattern of length m and an antidictionary M in O(m2 + ||M||) time, and then scans a compressed text of length n in O(n + r) time to find all pattern occurrences, where ||M|| is the total length of strings in M and r is the number of the pattern occurrences.