Crochemore, Maxime
125 Problems in Text Algorithms: with Solutions
- ISBN 13:
- 9781108798853
- author:
- Crochemore, Maxime
- format:
- Paperback
- publisher:
- Cambridge University Press
- language:
- English
- Publication Year:
- 2021
- Pages:
- 344
- Dimensions:
- 22.7 x 15 x 1.9 centimetres (0.5
- Genre:
- Computers, General, Computers,
- Condition:
- New
- Availability:
- Item usually sent within 5 working days
Description
String matching is one of the oldest algorithmic techniques in computer science, yet it remains a fundamental concept with diverse applications. This collection of puzzles and exercises covers key areas of text algorithms and combinatorics on words, providing graduate students and researchers with a practical way to learn and practice advanced concepts. The problems presented are drawn from a range of scientific publications, including both classic and new sources. The book builds upon basic concepts before exploring topics such as combinatorics on words, pattern matching, efficient text data structures, regularities in words, and text compression. With its copious illustrations, this book offers a comprehensive resource for those looking to deepen their understanding of these important areas. Suitable for graduate students and researchers seeking to expand their knowledge of text algorithms and combinatorics on words, this collection provides a valuable opportunity to learn and practice with advanced concepts in a practical and engaging way.