computer science, string-searching algorithms, sometimes called string-matching algorithms, are an important class of string algorithms that try to find...

the Boyer–Moore string-search algorithm is an efficient string-searching algorithm that is the standard benchmark for practical string-search literature...

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)...

algorithm is a string-searching algorithm invented by Alfred V. Aho and Margaret J. Corasick in 1975. It is a kind of dictionary-matching algorithm that...

Knuth–Morris–Pratt algorithm (or KMP algorithm) is a string-searching algorithm that searches for occurrences of a "word" W within a main "text string" S by employing...

data alignment. Also see String-searching algorithm which has detailed analysis of other string searching algorithms. The Algorithm Efficiency: The number...

In computer science, approximate string matching (often colloquially referred to as fuzzy string searching) is the technique of finding strings that match...

database indexes. Search algorithms can be classified based on their mechanism of searching into three types of algorithms: linear, binary, and hashing...

In computer science, the two-way string-matching algorithm is a string-searching algorithm, discovered by Maxime Crochemore and Dominique Perrin in 1991...

the theory of algorithms and data structures used for string processing. Some categories of algorithms include: String searching algorithms for finding...