Software—Practice & Experience
Efficient text searching
A Four Russians algorithm for regular expression pattern matching
Journal of the ACM (JACM)
A new approach to text searching
Communications of the ACM
Two-dimensional periodicity and its applications
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
A subquadratic algorithm for approximate regular expression matching
Journal of Algorithms
Let sleeping files lie: pattern matching in Z-compressed files
Journal of Computer and System Sciences
String matching in the DNA alphabet
Software—Practice & Experience
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
A fast string searching algorithm
Communications of the ACM
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Programming Techniques: Regular expression search algorithm
Communications of the ACM
Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences
Faster String Matching with Super-Alphabets
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
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
Shift-or string matching with super-alphabets
Information Processing Letters
Efficient randomized pattern-matching algorithms
IBM Journal of Research and Development - Mathematics and computing
An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Faster Regular Expression Matching
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Accelerating Boyer Moore searches on binary texts
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Constant-Time word-size string matching
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Approximate pattern matching with k-mismatches in packed text
Information Processing Letters
| Hi-index | 0.00 |
Given strings P and Q the (exact) string matching problem is to find all positions of substrings in Q matching P. The classical Knuth-Morris-Pratt algorithm [SIAM J. Comput. 6 (2) (1977) 323-350] solves the string matching problem in linear time which is optimal if we can only read one character at the time. However, most strings are stored in a computer in a packed representation with several characters in a single word, giving us the opportunity to read multiple characters simultaneously. In this paper we study the worst-case complexity of string matching on strings given in packed representation. Let m=