Construction of Aho Corasick automaton in linear time for integer alphabets

Authors:
Shiri Dori;Gad M. Landau
Affiliations:
Department of Computer Science, University of Haifa, Mount Carmel, Haifa, Israel;Department of Computer Science, University of Haifa, Mount Carmel, Haifa, Israel and Department of Computer and Information Science, Polytechnic University, Six MetroTech Center, Brooklyn, NY
Venue:
Information Processing Letters
Year:
2006

Citing 11
Cited 1

Three partition refinement algorithms

SIAM Journal on Computing
New indices for text: PAT Trees and PAT arrays

Information retrieval
Suffix arrays: a new method for on-line string searches

SIAM Journal on Computing
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
A Space-Economical Suffix Tree Construction Algorithm

Journal of the ACM (JACM)
Efficient string matching: an aid to bibliographic search

Communications of the ACM
Optimal suffix tree construction with large alphabets

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Replacing suffix trees with enhanced suffix arrays

Journal of Discrete Algorithms - SPIRE 2002
Linear-time construction of suffix arrays

CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Space efficient linear time construction of suffix arrays

CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Simple linear work suffix array construction

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

A Simple Algorithm for Finding Exact Common Repeats

IEICE - Transactions on Information and Systems

Quantified Score

Hi-index	0.89

Visualization

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(m log |Σ| + 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.