The Complexity of the Approximate Multiple Pattern Matching Problem for Random Strings

Abstract

15 We describe a multiple string pattern matching algorithm which is well-suited for approximate 16 search, and dictionaries composed of words of different lengths. We prove that this algorithm has 17 optimal complexity rate up to a multiplicative constant, for arbitrary dictionaries. This extends to 18 arbitrary dictionaries the classical results of Yao [SIAM J. Comput. 8, 1979] and Chang and Marr 19 [Proc. CPM94, 1994]. 2