A fast string-searching algorithm for multiple patterns

Noriyoshi Uratani, Masayuki Takeda

研究成果: Contribution to journalArticle査読

4 被引用数 (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.

本文言語英語
ページ(範囲)775-791
ページ数17
ジャーナルInformation Processing and Management
29
6
DOI
出版ステータス出版済み - 1993

All Science Journal Classification (ASJC) codes

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

フィンガープリント 「A fast string-searching algorithm for multiple patterns」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル