Cole, Richard ; Hariharan, Ramesh
(1997)
*Tighter upper bounds on the exact complexity of string matching*
SIAM Journal on Computing, 26
(3).
pp. 803-856.
ISSN 0097-5397

Full text not available from this repository.

Official URL: http://epubs.siam.org/doi/abs/10.1137/S00975397932...

Related URL: http://dx.doi.org/10.1137/S009753979324694X

## Abstract

This paper considers how many character comparisons are needed to find all occurrences 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 + \frac{8}{3(m+1)}(n-m)$ character comparisons. This bound is achieved by an online algorithm which performs O (n) work in total and requires O (m) space and O (m2) time for preprocessing. The current best lower bound for online algorithms is $n + \frac {16}{7m+27}(n-m)$ character comparisons for $m = 16k + 19$, for any integer $k\geq 1$ and for general algorithms is $n+\frac{2}{m+3}(n-m)$ character comparisons, for $m = 2k+1$, for any integer $k\geq 1$.

Item Type: | Article |
---|---|

Source: | Copyright of this article belongs to Society for Industrial and Applied Mathematics. |

ID Code: | 102264 |

Deposited On: | 09 Mar 2018 11:23 |

Last Modified: | 09 Mar 2018 11:23 |

Repository Staff Only: item control page