Research on a faster algorithm for pattern matching
IRAL '00 Proceedings of the fifth international workshop on on Information retrieval with Asian languages
Automatic generation of efficient string matching algorithms by generalized partial computation
ASIA-PEPM '02 Proceedings of the ASIAN symposium on Partial evaluation and semantics-based program manipulation
On the Complexity of Determining the Period of a String
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
A unifying look at the Apostolico--Giancarlo string-matching algorithm
Journal of Discrete Algorithms
Ladderlike stepping and interval jumping searching algorithms for DNA sequences
APBC '04 Proceedings of the second conference on Asia-Pacific bioinformatics - Volume 29
Chinese string searching using the KMP algorithm
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Average case analysis of the Boyer-Moore algorithm
Random Structures & Algorithms
Algorithms and theory of computation handbook
| Hi-index | 0.00 |
The problem of finding all occurrences of a pattern of length $m$ in a text of length $n$ is considered. It is shown that the Boyer--Moore string matching algorithm performs roughly $3n$ comparisons and that this bound is tight up to $O(n/m)$; more precisely, an upper bound of $3n - 3(n-m+1)/(m+2)$ comparisons is shown, as is a lower bound of $3n(1-o(1))$ comparisons, as $\frac{n}{m}\rightarrow\infty$ and $m\rightarrow\infty$. While the upper bound is somewhat involved, its main elements provide a simple proof of a $4n$ upper bound for the same algorithm.