Aho-Corasick
← Back to Pattern Matching
A multi-pattern string matching algorithm that constructs an automaton from a set of patterns and processes the text in a single pass. O(n + m + z) time where z is the number of matches. Used in intrusion detection, spam filtering, and bioinformatics.