Construction of Aho Corasick automaton in linear time for integer alphabets

Shiri Dori; Gad M. Landau

doi:10.1016/j.ipl.2005.11.019

Construction of Aho Corasick automaton in linear time for integer alphabets

Shiri Dori, Gad M. Landau

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

We present a new simple algorithm that constructs an Aho Corasick automaton for a set of patterns, P, of total length n, in O(n) time and space for integer alphabets. Processing a text of size m over an alphabet Σ with the automaton costs O(mlog|Σ|+k), where there are k occurrences of patterns in the text. A new, efficient implementation of nodes in the Aho Corasick automaton is introduced, which works for suffix trees as well.

Original language	English
Pages (from-to)	66-72
Number of pages	7
Journal	Information Processing Letters
Volume	98
Issue number	2
DOIs	https://doi.org/10.1016/j.ipl.2005.11.019
State	Published - 30 Apr 2006

Bibliographical note

Funding Information:
* Corresponding author. Tel.: +972 4 828 8375, fax: +972 4 824 9331. E-mail address: shiri@cri.haifa.ac.il (S. Dori). 1 Tel.: +972 4 824 0103, fax: +972 4 824 9331. Partially supported by the Israel Science Foundation grants 282/01 and 35/05.

Keywords

Design of algorithms
String matching
Suffix array
Suffix tree

ASJC Scopus subject areas

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

10.1016/j.ipl.2005.11.019

Cite this

@article{2f21452bd9cd4e4ababd9fa85749d23e,

title = "Construction of Aho Corasick automaton in linear time for integer alphabets",

abstract = "We present a new simple algorithm that constructs an Aho Corasick automaton for a set of patterns, P, of total length n, in O(n) time and space for integer alphabets. Processing a text of size m over an alphabet Σ with the automaton costs O(mlog|Σ|+k), where there are k occurrences of patterns in the text. A new, efficient implementation of nodes in the Aho Corasick automaton is introduced, which works for suffix trees as well.",

keywords = "Design of algorithms, String matching, Suffix array, Suffix tree",

author = "Shiri Dori and Landau, {Gad M.}",

note = "Funding Information: * Corresponding author. Tel.: +972 4 828 8375, fax: +972 4 824 9331. E-mail address: shiri@cri.haifa.ac.il (S. Dori). 1 Tel.: +972 4 824 0103, fax: +972 4 824 9331. Partially supported by the Israel Science Foundation grants 282/01 and 35/05.",

year = "2006",

month = apr,

day = "30",

doi = "10.1016/j.ipl.2005.11.019",

language = "English",

volume = "98",

pages = "66--72",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - Construction of Aho Corasick automaton in linear time for integer alphabets

AU - Dori, Shiri

AU - Landau, Gad M.

N1 - Funding Information: * Corresponding author. Tel.: +972 4 828 8375, fax: +972 4 824 9331. E-mail address: shiri@cri.haifa.ac.il (S. Dori). 1 Tel.: +972 4 824 0103, fax: +972 4 824 9331. Partially supported by the Israel Science Foundation grants 282/01 and 35/05.

PY - 2006/4/30

Y1 - 2006/4/30

N2 - We present a new simple algorithm that constructs an Aho Corasick automaton for a set of patterns, P, of total length n, in O(n) time and space for integer alphabets. Processing a text of size m over an alphabet Σ with the automaton costs O(mlog|Σ|+k), where there are k occurrences of patterns in the text. A new, efficient implementation of nodes in the Aho Corasick automaton is introduced, which works for suffix trees as well.

AB - We present a new simple algorithm that constructs an Aho Corasick automaton for a set of patterns, P, of total length n, in O(n) time and space for integer alphabets. Processing a text of size m over an alphabet Σ with the automaton costs O(mlog|Σ|+k), where there are k occurrences of patterns in the text. A new, efficient implementation of nodes in the Aho Corasick automaton is introduced, which works for suffix trees as well.

KW - Design of algorithms

KW - String matching

KW - Suffix array

KW - Suffix tree

UR - http://www.scopus.com/inward/record.url?scp=32644440602&partnerID=8YFLogxK

U2 - 10.1016/j.ipl.2005.11.019

DO - 10.1016/j.ipl.2005.11.019

M3 - Article

AN - SCOPUS:32644440602

SN - 0020-0190

VL - 98

SP - 66

EP - 72

JO - Information Processing Letters

JF - Information Processing Letters

IS - 2

ER -

Construction of Aho Corasick automaton in linear time for integer alphabets

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this