### Search

ato.my
String-searching algorithm
computer science, string-searching algorithms, sometimes called string-matching algorithms, are an important class of string algorithms that try to find
Boyer–Moore string-search algorithm
the Boyer–Moore string-search algorithm is an efficient string-searching algorithm that is the standard benchmark for practical string-search literature
Knuth–Morris–Pratt algorithm
Knuth–Morris–Pratt string-searching algorithm (or KMP algorithm) searches for occurrences of a "word" W within a main "text string" S by employing the
Aho–Corasick algorithm
Aho–Corasick algorithm is a string-searching algorithm invented by Alfred V. Aho and Margaret J. Corasick. It is a kind of dictionary-matching algorithm that
Rabin–Karp algorithm
In computer science, the Rabin–Karp algorithm or Karp–Rabin algorithm is a string-searching algorithm created by Richard M. Karp and Michael O. Rabin (1987)
Approximate string matching
In computer science, approximate string matching (often colloquially referred to as fuzzy string searching) is the technique of finding strings that match
Search algorithm
In computer science, a search algorithm is any algorithm which solves the search problem, namely, to retrieve information stored within some data structure
Boyer–Moore–Horspool algorithm
simplification of the Boyer–Moore string search algorithm which is related to the Knuth–Morris–Pratt algorithm. The algorithm trades space for time in order
Two-way string-matching algorithm
In computer science, the two-way string-matching algorithm is an efficient string-searching algorithm that can be viewed as a combination of the forward-going
Bitap algorithm
bitap algorithm (also known as the shift-or, shift-and or Baeza-Yates–Gonnet algorithm) is an approximate string matching algorithm. The algorithm tells