|
gptkbp:instanceOf
|
gptkb:string-search_algorithm
|
|
gptkbp:averageCaseComplexity
|
O(n)
|
|
gptkbp:bestCaseComplexity
|
O(n/m)
|
|
gptkbp:category
|
computer science
pattern matching
string algorithms
|
|
gptkbp:hasWikipediaPage
|
https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string-search_algorithm
|
|
gptkbp:influenced
|
gptkb:Boyer–Moore–Horspool_algorithm
|
|
gptkbp:input
|
gptkb:text
gptkb:pattern
|
|
gptkbp:introducedIn
|
1977
|
|
gptkbp:inventedBy
|
gptkb:J_Strother_Moore
gptkb:Robert_S._Boyer
|
|
gptkbp:language
|
English
|
|
gptkbp:notableFor
|
efficient practical performance
|
|
gptkbp:output
|
positions of pattern in text
|
|
gptkbp:publishedIn
|
gptkb:SIAM_Journal_on_Computing
|
|
gptkbp:relatedTo
|
gptkb:Knuth–Morris–Pratt_algorithm
gptkb:Rabin–Karp_algorithm
gptkb:Aho–Corasick_algorithm
|
|
gptkbp:usedFor
|
finding substrings in text
|
|
gptkbp:usesHeuristic
|
bad character rule
good suffix rule
|
|
gptkbp:worstCaseComplexity
|
O(nm)
|
|
gptkbp:bfsParent
|
gptkb:Karp–Rabin_algorithm
|
|
gptkbp:bfsLayer
|
5
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Boyer–Moore algorithm
|