Handbook of Exact String Matching Algorithms

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.

Author: Christian Charras, Thierry Lecroq
Publisher: College Publications
Published: 02/27/2004
Pages: 256
Binding Type: Paperback
Weight: 0.80lbs
Size: 9.21h x 6.14w x 0.54d
ISBN: 9780954300647

This title is not returnable