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 | |
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