|
|
|
Lecture Notes Series on Computing - Vol. 3
STRING SEARCHING ALGORITHMS
by Graham A Stephen (University of Wales, UK)
String searching is a subject of both theoretical and practical interest in computer science. This book presents a bibliographic overview of the field and an anthology of detailed descriptions of the principal algorithms available. The aim is twofold: on the one hand, to provide an easy-to-read comparison of the available techniques in each area, and on the other, to furnish the reader with a reference to in-depth descriptions of the major algorithms. Topics covered include methods for finding exact and approximate string matches, calculating 'edit' distances between strings, finding common sequences and finding the longest repetitions within strings. For clarity, all the algorithms are presented in a uniform format and notation.
Contents:
- Introduction
- String Matching
- String Distance and Common Sequences
-
Suffix Trees
- Approximate String Matching
- Repeated Substrings
Readership: Computer scientists, software developers and computational
biologists.
"... a self-contained reference ... this book can also act as an initial guide for further forays into the literature."
| 256pp |
Pub. date: Oct 1994 |
|
|
