Author: M. Crochemore and W. Rytter.
Table of Contents
- Introduction
- Foundations
- Basic string-matching algorithms
- The Boyer-Moore algorithm and its variations
- Suffix trees
- Subword graphs
- Automata theoretic approach
- Regularities in texts: symmetries and repetitions
- Almost optimal parallel algorithms
- Text compression techniques
- Approximate pattern matching
- Two-dimensional pattern matching
- Time-space optimal string matching
- Time-processors optimal string matching
- Miscellanies