Charras C., Lecroq T. Handbook of Exact String-Matching Algorithms

College Publications, 2004. 256 pages. На англ. языке.
ISBN-10: 9780954300647
ISBN-13: 978-0954300647

Хорошая коллекция алгоритмов сравнения и поиска строк: от классики (Кнут-Морис-Пратт) до кластерных алгоритмов. С подробными описаниями и вставками кода на C.

String matching is a very important subject in the wider domain of text processing. It consists of finding one,or more generally, all the occurrences of a string (more generally called a patte) in a text. The Handbook of Exact String Matching Algorithms presents 38 methods for solving this problem. For each, it gives the main features, a description, its C code, an example and references.

Introduction
Brute Force algorithm
Deterministic Finite Automaton algorithm
Karp-Rabin algorithm
Shift Or algorithm
Morris-Pratt algorithm
Knuth-Morris-Pratt algorithm
Simon algorithm
Colussi algorithm
Galil-Giancarlo algorithm
Apostolico-Crochemore algorithm
Not So Naive algorithm
Boyer-Moore algorithm
Turbo BM algorithm
Apostolico-Giancarlo algorithm
Reverse Colussi algorithm
Horspool algorithm
Quick Search algorithm
Tuned Boyer-Moore algorithm
Zhu-Takaoka algorithm
Berry-Ravindran algorithm
Smith algorithm
Raita algorithm
Reverse Factor algorithm
Turbo Reverse Factor algorithm
Forward Dawg Matching algorithm
Backward Nondeterministic Dawg Matching algorithm
Backward Oracle Matching algorithm
Galil-Seiferas algorithm
Two Way algorithm
String Matching on Ordered Alphabets algorithm
Optimal Mismatch algorithm
Maximal Shift algorithm
Skip Search algorithm
KMP Skip Search algorithm
Alpha Skip Search algorithm