A fast string-searching algorithm for multiple patterns

Noriyoshi Uratani, Masayuki Takeda

Research output: Contribution to journalArticlepeer-review

8 Citations (Scopus)


The string-searching problem is to find all occurrences of pattern(s) in a text string. The Aho-Corasick string searching algorithm simultaneously finds all occurrences of multiple patterns in one pass through the text. On the other hand, the Boyer-Moore algorithm is understood to be the fastest algorithm for a single pattern. By combining the ideas of these two algorithms, we present an efficient string searching algorithm for multiple patterns. The algorithm runs in sublinear time, on the average, as the BM algorithm achieves, and its preprocessing time is linear proportional to the sum of the lengths of the patterns like the AC algorithm.

Original languageEnglish
Pages (from-to)775-791
Number of pages17
JournalInformation Processing and Management
Issue number6
Publication statusPublished - 1993

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Media Technology
  • Computer Science Applications
  • Management Science and Operations Research
  • Library and Information Sciences


Dive into the research topics of 'A fast string-searching algorithm for multiple patterns'. Together they form a unique fingerprint.

Cite this