| y (2007) | |||||||||||||||
Abstract | |||||||||||||||
| The paper considers the exact number of character comparisons needed to nd 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 + 9 | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||