|Handbook of Exact String Matching Algorithms|
Christian Charras, Thierry Lecroq
String matching is a very important subject in the wider domain of text processing. It consists in finding one, or more generally, all the occurrences of a string (more generally called a pattern) in a text.
The Handbook of Exact String Matching Algorithms presents 38 methods for solving this problem. For each, it gives its main features, a description, its C code, an example, and references.
19 October 2004
Buy from Amazon: UK US