Optimal parallel pattern matching in strings
Information and Control
Optimal parallel algorithms for string matching
Information and Control
Software—Practice & Experience
An optimal O(log n)time parallel string matching algorithm
SIAM Journal on Computing
Deterministic sampling: a new technique for fast pattern matching
SIAM Journal on Computing
A lower bound for parallel string matching
SIAM Journal on Computing
Faster parallel string matching via larger deterministic samples
Journal of Algorithms
A constant-time optimal parallel string-matching algorithm
Journal of the ACM (JACM)
Work-time-optimal parallel algorithms for string problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
String matching in the DNA alphabet
Software—Practice & Experience
Constant-Time Randomized Parallel String Matching
SIAM Journal on Computing
Transforming comparison model lower bounds to the parallel-random-access-machine
Information Processing Letters
A fast string searching algorithm
Communications of the ACM
Faster String Matching with Super-Alphabets
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
A Bit-Parallel Approach to Suffix Automata: Fast Extended String Matching
CPM '98 Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching
Shift-or string matching with super-alphabets
Information Processing Letters
Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Accelerating Boyer Moore searches on binary texts
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Fast searching in packed strings
Journal of Discrete Algorithms
Worst case efficient single and multiple string matching in the RAM model
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Art of Computer Programming, Volumes 1-4A Boxed Set
Art of Computer Programming, Volumes 1-4A Boxed Set
Approximate pattern matching with k-mismatches in packed text
Information Processing Letters
| Hi-index | 0.00 |
We present a novel string-matching algorithm that requires constant time for text scanning in an unusual model where (a) the input pattern and text are each packed into a single word, (b) the output is a one word bit-mask identifying the pattern occurrences in the text, and (c) there are constant-time arithmetic, bitwise, and shift instructions that operate on words whose size is proportional to the arbitrarily long input length. Our bit-parallelism techniques build upon and also greatly simplify existing parallel random access machine algorithms by using two "simple structure" rather than "small size" deterministic samples, i.e., one deterministic sample is very small (size two), while the other is a potentially very long prefix of the pattern. Pattern preprocessing takes time proportional to the word size. Our results also establish, by recent reductions, new bounds for the packed string matching problem.