Tighter Upper Bounds on the Exact Complexity of String Matching


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 + 8 3(m+1) (n −m) character comparisons. This bound is… (More)
DOI: 10.1137/S009753979324694X


8 Figures and Tables

Slides referencing similar topics