@TechReport{Dartmouth:TR90-143,
  author = {Samuel W. Bent},
  title = {{Matching Multiple Patterns From Right to Left}},
  institution = {Dartmouth College, Computer Science},
  address = {Hanover, NH},
  number = {PCS-TR90-143},
  year = {1990},
  URL = {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.
  }
}