Stephen G.A. String Searching Algorithms

World Scientific, 1994. — 252 p.A number of important string-searching algorithms have been collected together and presented in this volume in a uniform format and notation. The topics covered include exact and approximate string-matching, edit-distance related problems, and problems involving repeated patterns.
The text is intended for computer scientists, software developers, computational biologists, and others with an interest in string-processing techniques. A fairly high level of familiarity with programming concepts has been assumed. The material is therefore suitable for readers at an advanced-undergraduate or postgraduate level.
This book started life as a technical report that surveyed a number of string algorithms. It has since evolved, though, having been subject to much revision, correction, and augmentation. The aim has been to provide comprehensive coverage of the selected topics. But inevitably, as with any project of this nature, there are certain to be omissions. Nonetheless, the text should prove to be useful. For those interested in learning about the methods described here, the level of detail should make this a self-contained reference. And for those involved in wider research, this book can also act as an initial guide for further forays into the literature.
The reader is invited to browse through the overview section of each chapter before delving into the nuts and bolts of specific algorithms. These overviews are intended to pave the way by providing a gentle introduction to the concepts involved in the principal algorithms. They also offer a historical perspective to the development of the major techniques in each area.String Matching
String Distance and Common Sequences
Suffix Trees
Approximate String Matching
Repeated Substrings