*(English)*Zbl 1078.68151

Efficient algorithms for matching a text sample against a given text are not only theoretically interesting; they also have many important applications, ranging from basic text editor functions, over look-up operations in dictionaries, to alignment problems for DNA sequences.

In their new book, the authors present some algorithmic jewels of this field, starting from textbook classics like the Knuth-Morris-Pratt and Boyer-Moore algorithms, then moving on to two-dimensional and parallel algorithms. One can only agree with the authors that such jewels deserve to shine. On the other hand, it is not so clear which group of readers profit most from this collection. Students may find the – seemingly smooth – text hard to read at some places, whereas the experienced reader can always resort to the excellent book on text algorithms by the same authors [Text algorithms. New York, NY: Oxford Univ. Press (1994; Zbl 0844.68101)]. Still, the book is a valuable addition to the field.