Tighter upper bounds on the exact complexity of string matching.
This paper considers how many character comparisons are needed to find all occurences of a pattern of length m in a text of length n. The main contribution is to show an upper bound of the form of n + O (n/m) character comparisons, following preprocessing. Specifically, we show an upper bound of n +...
| Publicat a: | SIAM journal on computing. 26, 3 (1997). |
|---|---|
| Autor principal: | |
| Format: | Article |
| Idioma: | English |
| Matèries: |