BIB-VERSION:: CS-TR-v2.0
ID:: ncstrl.dartmouthcs//TR90-143
ENTRY:: January 20, 1995
ORGANIZATION:: Dartmouth College, Computer Science
TITLE:: Matching Multiple Patterns From Right to Left
TYPE:: Technical Report (paper)
REVISION:: 1
AUTHOR:: Bent, Samuel W.
NOTE:: The 'January' in DATE is an arbitrary placeholder.
DATE:: January 1990
RETRIEVAL:: For a paper copy, email <reports@cs.dartmouth.edu>
RETRIEVAL:: For a paper copy, write to
       Technical Report Librarian
       Department of Computer Science
       Dartmouth College
       6211 Sudikoff Laboratory
       Hanover, NH 03755-3510
       USA
RETRIEVAL:: PDF at http://www.cs.dartmouth.edu/reports/TR90-143.pdf
ABSTRACT::
	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.
END:: ncstrl.dartmouthcs//TR90-143