Which patterns are hard to find? (String matching)
Richard J. Cole, R. Hariharan, Mike Paterson, Uri Zwick · 2002
The paper considers the exact number of character comparisons needed to find all occurrences of a pattern of length m in a text of length n using on-line and general algorithms. For on-line algorithms, a lower bound of about (1+/sup 9///sub 4(m+1)/).n character comparisons is obtained. For general algorithms, a lower bound of about (1+/sup 2///sub m+3/).n character comparisons is obtained. These lower bound complement an on-line upper bound of about (1+/sup 8///sub 3(m+1)/).n comparisons obtained recently by Cole and Hariharan (1992). The lower bounds are obtained by finding patterns with interesting combinatorial properties (these are the hard to find patterns). It is also shown that for some patterns off-line algorithms can be more efficient than on-line algorithms.>