algorithme de Boyer-Moore
Sign in to saveAlso known as Boyer-Moore algorithm
algorithme de recherche de sous-chaîne particulièrement efficace, développé en 1977
In the Vinony graph
Within Vinony's link graph, algorithme de Boyer-Moore is referenced by 73 other articles, and connects out to computer science, International Standard Book Number and Q2407.
Vinony files it under Computer-related introductions in 1977 and String matching algorithms.
Its subject is documented across 19 Wikipedia language editions.
Wikidata facts
Show 3 more facts
- inception
- 1977-00-00
- publication date
- 1977-10-00
- Commons category
- Boyer–Moore string search algorithm
Sources (2)
via Wikidata · CC0
Article · Français
L'algorithme de Boyer-Moore est un algorithme de recherche de sous-chaîne particulièrement efficace. Il a été développé par Robert S. Boyer et J Strother Moore en 1977.
Abstract from DBpedia / Wikipedia · CC BY-SA
Connections
computer science
Entity
International Standard Book Number
Entity
Q2407
Entity
digital object identifier
Entity
International Standard Serial Number
Entity
Donald Knuth
Entity
GNU
Entity
data structure
Entity
regular expression
Entity
Go
Entity
string
Entity
D
Entity
Levenshtein distance
Entity
parsing
Entity
Q22908627
Entity
Q283302
Entity
Hamming distance
Entity
sequence alignment
Entity
time complexity
Entity
preprocessor
Entity