Optimal Shift-Or String Matching Algorithm for Multiple Patterns
Rajesh Prasad, Suneeta Agarwal · 2007
In this paper, we develop a new algorithm for handling multiple patterns, which is based on average optimal shift-or algorithm. We have assumed that the pattern representation fits into a single computer word and length of each pattern is equal. We have adopted the concept of classes of characters for handling multiple patterns. We compare the performance of the proposed algorithm with the standard shift-or algorithm. The experimental results show that our algorithm is the faster in most of the cases.