TY - JOUR
T1 - A fast string-searching algorithm for multiple patterns
AU - Uratani, Noriyoshi
AU - Takeda, Masayuki
PY - 1993
Y1 - 1993
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=28044472203&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=28044472203&partnerID=8YFLogxK
U2 - 10.1016/0306-4573(93)90106-N
DO - 10.1016/0306-4573(93)90106-N
M3 - Article
AN - SCOPUS:28044472203
VL - 29
SP - 775
EP - 791
JO - Information Storage and Retrieval
JF - Information Storage and Retrieval
SN - 0306-4573
IS - 6
ER -