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 pattern) 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.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!