Skip to product information
1 of 1

Maxime Crochemore,Thierry Lecroq,Wojciech Rytter

125 Problems in Text Algorithms: with Solutions

125 Problems in Text Algorithms: with Solutions

💎 Earn 180 Points (£1.80) on this item.

Regular price £36.18 GBP
Regular price £38.00 GBP Sale price £36.18 GBP
Sale Sold out
Taxes included. Shipping calculated at checkout.

YOU SAVE £1.82

  • Condition: Brand new
  • UK Delivery times: Usually arrives within 2 - 3 working days
  • UK Shipping: Fee starts at £2.39. Subject to product weight & dimension

Bulk ordering. Want 15 or more copies? Get a personalised quote and bigger discounts. Learn more about bulk orders.

  • More about 125 Problems in Text Algorithms: with Solutions


String matching is an old algorithmic technique that has seen technological leaps in the past 20 years, from information retrieval to compression. This book offers puzzles and exercises to help graduate students and researchers learn and practice advanced concepts in text algorithms and combinatorics. The problems are drawn from a wide range of scientific publications and cover topics such as combinatorics on words, pattern matching, efficient text data structures, regularities in words, and text compression.

Format: Paperback / softback
Length: 344 pages
Publication date: 01 July 2021
Publisher: Cambridge University Press


String matching is a fundamental algorithmic technique that has been widely used in computer science for decades. Over the past two decades, significant advancements have been made in various applications, ranging from information retrieval to compression. This comprehensive collection of puzzles and exercises in key areas of text algorithms and combinatorics provides a delightful and direct approach for graduate students and researchers to learn and practice advanced concepts. The problems are drawn from a diverse range of scientific publications, including both classic and contemporary works. The book begins by covering the basics and gradually progresses to showcase challenging problems in combinatorics on words, such as Fibonacci or Thue-Morse words. It also explores pattern matching algorithms, including Knuth-Morris-Pratt and Boyer-Moore-like techniques, as well as efficient text data structures like suffix trees and suffix arrays. Additionally, the book delves into regularities in words, such as periods and runs, and text compression methods, including Huffman, Lempel-Ziv, and Burrows-Wheeler-based approaches. By presenting these problems in a step-by-step manner, the book aims to facilitate a deeper understanding of text algorithms and combinatorics, enabling readers to apply their knowledge in real-world scenarios. Whether you are a computer science student or a researcher seeking to expand your expertise in this field, this book is an invaluable resource for your studies and research.

Weight: 508g
Dimension: 153 x 228 x 26 (mm)
ISBN-13: 9781108798853

This item can be found in:

UK and International shipping information

UK Delivery and returns information:

  • Delivery within 2 - 3 days when ordering in the UK.
  • Shipping fee for UK customers from £2.39. Fully tracked shipping service available.
  • Returns policy: Return within 30 days of receipt for full refund.

International deliveries:

Shulph Ink now ships to Australia, Belgium, Canada, France, Germany, Ireland, Italy, India, Luxembourg Saudi Arabia, Singapore, Spain, Netherlands, New Zealand, United Arab Emirates, United States of America.

  • Delivery times: within 5 - 10 days for international orders.
  • Shipping fee: charges vary for overseas orders. Only tracked services are available for most international orders. Some countries have untracked shipping options.
  • Customs charges: If ordering to addresses outside the United Kingdom, you may or may not incur additional customs and duties fees during local delivery.
View full details