On Sun, May 05, 2002 at 06:39:50PM -0700, Brian Pane wrote: > Does anyone know of an efficient algorithm for comparing > an input string against a set of multiple pattern strings?
Well, there seems to be a lot of work related to approximate string matching. I don't think that'd work. But, the guy who came up with the BNDM algorithm we used in mod_include has this paper: Fast Multipattern Search Algorithms for Intrusion Detection Josu� Kuri and Gonzalo Navarro http://www.dcc.uchile.cl/~gnavarro/ps/spire00.1.ps.gz This paper also looks interesting (has some C fragments): A Fast Multiple String-Pattern Matching Algorithm Sun Kim and Yanggon Kim http://bio.informatics.indiana.edu/sunkim/papers/multi/multi2.ps I just gave those a quick look-see, but the Related Works sections may point you in other directions. -- justin
