Tight bounds on the complexity of the Apostolico-Giancarlo algorithm
Abstract
The Apostolico-Giancarlo string-matching algorithm is analyzed precisely. We give a tight upper bound of 3n/2 text character comparisons when searching for a pattern in a text of length n. We exhibit a family of patterns and texts reaching this bound. We also provide a slightly improved version of the algorithm.
Origin : Files produced by the author(s)