Boyer-Moore-Algorithmus
Sign in to saveAlso known as Boyer-Moore algorithm
String-Matching-Algorithmus
In the Vinony graph
Vinony's link graph records 73 inbound references to Boyer-Moore-Algorithmus, and connects out to computer science, International Standard Book Number and Q2407.
It is catalogued under topics including Computer-related introductions in 1977 and String matching algorithms.
Vinony links it to 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 · Deutsch
Der Boyer-Moore-Algorithmus ist ein String-Matching-Algorithmus. Der Algorithmus wird dazu genutzt, um in einem Text T einen bestimmten Teiltext (Muster M) zu finden und wurde 1977 von Robert S. Boyer und J Strother Moore entwickelt.
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