Complexity of Sequential Pattern Matching Algorithms
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
On the Complexity of Determining the Period of a String
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
A simple fast hybrid pattern-matching algorithm
Journal of Discrete Algorithms
A simple fast hybrid pattern-matching algorithm
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
| Hi-index | 0.00 |
The maximal number of character comparisons made by a linear-time string matching algorithm, given a text string of length n and a pattern string of length m over a general alphabet, is investigated. The number is denoted by c(n,m) or approximated by (1+C)n, where C is a universal constant. The subscript 'online' is added when attention is restricted to online algorithms, and the superscript '1' is added when algorithms that find only one occurrence of the pattern in the text are considered. It is well known that n