Construction of Aho Corasick automaton in linear time for integer alphabets

Shiri Dori, Gad M. Landau

Research output: Contribution to journalConference articlepeer-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 languageEnglish
Pages (from-to)168-177
Number of pages10
JournalLecture Notes in Computer Science
Volume3537
DOIs
StatePublished - 2005
EventOt16th Annual Symposium on Combinatorial Pattern Matching, CPM 2005 - Jeju Island, Korea, Republic of
Duration: 19 Jun 200522 Jun 2005

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Construction of Aho Corasick automaton in linear time for integer alphabets'. Together they form a unique fingerprint.

Cite this