Technical Report Number
We address the problem of matching multiple pattern strings against a text string. Just as the Aho-Corasick algorithm generalizes the Knuth-Morris-Pratt single-pattern algorithm to handle multiple patterns, we exhibit two generalizations of the Boyer-Moore algorithm to handle multiple patterns. In order to obtain worst-case time bounds better than quadratic, our algorithms remember some of the previous history of the matching.
Dartmouth Digital Commons Citation
Bent, Samuel W. and Sridhar, M A., "Matching Multiple Patterns From Right to Left" (1987). Computer Science Technical Report PCS-TR90-143. https://digitalcommons.dartmouth.edu/cs_tr/44