
- Home
- Books
- Algorithms & Data Structures
- Core Algorithms
- Computing Patterns in Strings
Computing Patterns in Strings by Bill Smyth studies algorithms for discovering and processing patterns in strings. The book connects properties of words and repeated structures with the algorithms used to find them. Its emphasis on combinatorial reasoning helps readers understand why a method works and how string-processing techniques relate to searching and other applications that operate on sequences of symbols.
What you will learn
- Analyze patterns and repetitions in strings
- Compare string-searching algorithms
- Connect combinatorics on words with algorithm design
Who this is for
Computer science students and researchers studying string algorithms. Familiarity with algorithms and discrete mathematics is expected.


