On the Exact Complexity of String Matching (Extended Abstract)

of Results We investigate the maximal number of character comparisons made by a linear-time string matching algorithm, given a text of length n and a pattern of length m over a general alphabet. We denote it by c(n,m) or approximate it by (1 + C)n, where C is a universal constant. We add the subscript “on-line” when we restrict attention to on-line… CONTINUE READING