Aho–Corasick (AC) Algorithm (Multiple String Search String Search)

From Algorithm Wiki

Revision as of 12:14, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n + m + z)$ == Space Complexity == $O(km)$ words (Derived: Number of states of the automaton that is created) == Description == Automaton-based, finite automaton that tracks the partial prefix match == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1975 == Reference == https://cr.yp.to/bib/1975/aho.pdf")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n + m + z)$

Space Complexity

$O(km)$ words

(Derived: Number of states of the automaton that is created)

Description

Automaton-based, finite automaton that tracks the partial prefix match

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1975

Reference

https://cr.yp.to/bib/1975/aho.pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Aho–Corasick_(AC)_Algorithm_(Multiple_String_Search_String_Search)&oldid=45242"