Review of Algorithms on Strings

摘要

The book consists of nine chapters. Each chapter finishes with a historical section (references are given only there) and a set of exercises. Except a few chapters (e.g., the first for definition, or the fourth introducing suffix arrays) they can be read independently. Most of the definitions are intuitive and the more esoteric ones are well-referenced. All this means that you could pick up the chapter of your choice and just start reading!