It was written by Maxime Crochemore and Wojciech Rytter, and published by World Scientific in 2003.
It then describes the suffix tree, an index for quickly looking up matching substrings, and two algorithms for constructing it.
Approximate string matching is covered in several variations including edit distance and the longest common subsequence problem.
She writes that the book itself should become a valuable reference for researchers in this area, and that it could also be used to supplement undergraduate or graduate course material in algorithms.
[1] Reviewer Ricardo Baeza-Yates suggests that the book's omission of bit-level parallel programming techniques reflects its bias towards theoretical rather than practical methods, but nevertheless agrees with its suitability for graduate courses.