A Fast Multiple String-Pattern Matching Algorithm

In this paper, we propose a simple but eecient multiple string pattern matching algorithm based on a compact encoding scheme. This algorithm scans text from left to right while encoding characters in the text based on the alphabet that occurs in the input patterns. The simple scanning algorithm demonstrates the ability to handle a very large number of input patterns simultaneously. Our experiments demonstrate that our algorithm runs faster than state-of-the-art multiple pattern matching programs including grep and agrep in many cases.