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
Handbook of Exact String Matching Algorithms
✍ Scribed by Christian Charras, Thierry Lecroq
- Book ID
- 127409281
- Publisher
- College Publications
- Year
- 2004
- Tongue
- English
- Weight
- 713 KB
- Category
- Library
- ISBN-13
- 9780954300647
No coin nor oath required. For personal study only.
✦ Synopsis
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.
✦ Subjects
Теория алгоритмов
📜 SIMILAR VOLUMES
This article addresses the __online exact string matching problem__ which consists in finding __all__ occurrences of a given pattern __p__ in a text __t__ . It is an extensively studied problem in computer science, mainly due to its direct applications to such diverse areas as text, image and signal