|
gptkbp:instanceOf
|
gptkb:finite_state_machine_algorithm
gptkb:string_searching_algorithm
|
|
gptkbp:allows
|
length of the text
|
|
gptkbp:application
|
intrusion detection systems
search engines
bioinformatics
spam filters
|
|
gptkbp:canBeParallelized
|
true
|
|
gptkbp:category
|
computer science
algorithms
|
|
gptkbp:complexity
|
O(n + m + z)
|
|
gptkbp:describedBy
|
gptkb:Communications_of_the_ACM
|
|
gptkbp:describedInPaper
|
gptkb:Efficient_string_matching:_an_aid_to_bibliographic_search
|
|
gptkbp:input
|
set of strings (patterns)
text (to be searched)
|
|
gptkbp:introducedIn
|
1975
|
|
gptkbp:inventedBy
|
gptkb:Alfred_V._Aho
gptkb:Margaret_J._Corasick
|
|
gptkbp:isDeterministic
|
true
|
|
gptkbp:isOfflineAlgorithm
|
true
|
|
gptkbp:isOnlineAlgorithm
|
false
|
|
gptkbp:language
|
gptkb:Java
gptkb:Python
gptkb:C++
C
|
|
gptkbp:m
|
total length of all patterns
|
|
gptkbp:namedAfter
|
gptkb:Alfred_V._Aho
gptkb:Margaret_J._Corasick
|
|
gptkbp:openSource
|
gptkb:GNU_grep
gptkb:Hyperscan
gptkb:Python_ahocorasick_module
|
|
gptkbp:output
|
all occurrences of patterns in the text
|
|
gptkbp:relatedTo
|
gptkb:Knuth–Morris–Pratt_algorithm
gptkb:Boyer–Moore_algorithm
|
|
gptkbp:solvedBy
|
multiple pattern string matching
|
|
gptkbp:usesDataStructure
|
trie
failure links
|
|
gptkbp:z
|
number of pattern occurrences found
|
|
gptkbp:bfsParent
|
gptkb:Knuth–Morris–Pratt_algorithm
gptkb:Boyer–Moore_algorithm
|
|
gptkbp:bfsLayer
|
6
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Aho–Corasick algorithm
|