Construction of Aho Corasick automaton in linear time for integer alphabets

Shiri Dori; Gad M. Landau

doi:10.1007/11496656_15

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 › Conference 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 0(m log |∑| + k), where there are k occurrences of patterns in the text.

Original language	English
Pages (from-to)	168-177
Number of pages	10
Journal	Lecture Notes in Computer Science
Volume	3537
DOIs	https://doi.org/10.1007/11496656_15
State	Published - 2005
Event	Ot16th Annual Symposium on Combinatorial Pattern Matching, CPM 2005 - Jeju Island, Korea, Republic of Duration: 19 Jun 2005 → 22 Jun 2005

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/11496656_15

Cite this

@article{3601d441e7214aaebefe1a1388620450,

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 0(m log |∑| + k), where there are k occurrences of patterns in the text.",

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

year = "2005",

doi = "10.1007/11496656\_15",

language = "English",

volume = "3537",

pages = "168--177",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Science and Business Media Deutschland GmbH",

note = "Ot16th Annual Symposium on Combinatorial Pattern Matching, CPM 2005 ; Conference date: 19-06-2005 Through 22-06-2005",

}

TY - JOUR

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

AU - Dori, Shiri

AU - Landau, Gad M.

PY - 2005

Y1 - 2005

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 0(m log |∑| + k), where there are k occurrences of patterns in the text.

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 0(m log |∑| + k), where there are k occurrences of patterns in the text.

UR - https://www.scopus.com/pages/publications/26444476475

U2 - 10.1007/11496656_15

DO - 10.1007/11496656_15

M3 - Conference article

AN - SCOPUS:26444476475

SN - 0302-9743

VL - 3537

SP - 168

EP - 177

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

T2 - Ot16th Annual Symposium on Combinatorial Pattern Matching, CPM 2005

Y2 - 19 June 2005 through 22 June 2005

ER -

Construction of Aho Corasick automaton in linear time for integer alphabets

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this