-
computer science, the Aho–
Corasick algorithm is a string-searching
algorithm invented by
Alfred V. Aho and
Margaret J.
Corasick in 1975. It is a kind of...
- Commentz-Walter. Like the Aho–
Corasick string matching algorithm, it can
search for
multiple patterns at once. It
combines ideas from Aho–
Corasick with the fast matching...
-
efficiency of
pairwise sequence alignment." The
Keyword Tree
Theory and the Aho-
Corasick search algorithm is an
efficient approach to
solve the
pairwise sequence...
-
known as the Aho–
Corasick algorithm; it is used by
several bibliographic search-systems,
including the one
developed by
Margaret J.
Corasick, and by other...
- tree Hash trie Hash
array mapped trie
Prefix hash tree
Ctrie HAT-trie Aho–
Corasick algorithm Maabar, Maha (17
November 2014). "Trie Data Structure". CVR,...
- the matches,
which could be
greater than linear. In contrast, the Aho–
Corasick algorithm can find all
matches of
multiple patterns in worst-case time...
- in an
efficient manner.
Construction of the
failure function of the Aho-
Corasick pattern matcher.
Testing bipartiteness of a graph.
Implementing parallel...
-
matching strategy:
Match the
prefix first (Knuth–Morris–Pratt, Shift-And, Aho–
Corasick)
Match the
suffix first (Boyer–Moore and variants, Commentz-Walter) Match...
- "fgrep"
variant searches for any of a list of
fixed strings using the Aho–
Corasick string matching algorithm.
Binaries of
these variants exist in
modern systems...
-
string s, a
substring whose edit
distance to p is at most k (cf. the Aho–
Corasick algorithm,
which similarly constructs an
automaton to
search for any of...
