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.

Скачать книгу бесплатно (pdf, 713 Kb)

---

Читать «Handbook of Exact String Matching Algorithms »