Description

Book Synopsis

String matching is one of the oldest algorithmic techniques, yet still one of the most pervasive in computer science. The past 20 years have seen technological leaps in applications as diverse as information retrieval and compression. This copiously illustrated collection of puzzles and exercises in key areas of text algorithms and combinatorics on words offers graduate students and researchers a pleasant and direct way to learn and practice with advanced concepts. The problems are drawn from a large range of scientific publications, both classic and new. Building up from the basics, the book goes on to showcase problems in combinatorics on words (including Fibonacci or Thue-Morse words), pattern matching (including Knuth-Morris-Pratt and Boyer-Moore like algorithms), efficient text data structures (including suffix trees and suffix arrays), regularities in words (including periods and runs) and text compression (including Huffman, Lempel-Ziv and Burrows-Wheeler based methods).

Table of Contents

1. The Very Basics of Stringology; 2. Combinatorial Puzzles; 3. Pattern Matching; 4. Efficient Data Structures; 5. Regularities in Words; 6. Text Compression; 7. Miscellaneous.

125 Problems in Text Algorithms

    Product form

    A Paperback by Maxime Crochemore, Thierry Lecroq, Wojciech Rytter

    £43.30

    Includes FREE delivery

    Order before 4pm today for delivery by Thu 26 Nov 2026.

    15 in stock

      Trusted by thousands of customers. See 2,385+ Customer Reviews

      View other formats and editions of 125 Problems in Text Algorithms by Maxime Crochemore

      Book details

      Publisher Cambridge University Press
      Published 1 July 2021
      ISBN-13 9781108798853
      978-1108798853
      ISBN-10 1108798853
      Also in:
      Computer science

      Description

      Book Synopsis

      String matching is one of the oldest algorithmic techniques, yet still one of the most pervasive in computer science. The past 20 years have seen technological leaps in applications as diverse as information retrieval and compression. This copiously illustrated collection of puzzles and exercises in key areas of text algorithms and combinatorics on words offers graduate students and researchers a pleasant and direct way to learn and practice with advanced concepts. The problems are drawn from a large range of scientific publications, both classic and new. Building up from the basics, the book goes on to showcase problems in combinatorics on words (including Fibonacci or Thue-Morse words), pattern matching (including Knuth-Morris-Pratt and Boyer-Moore like algorithms), efficient text data structures (including suffix trees and suffix arrays), regularities in words (including periods and runs) and text compression (including Huffman, Lempel-Ziv and Burrows-Wheeler based methods).

      Table of Contents

      1. The Very Basics of Stringology; 2. Combinatorial Puzzles; 3. Pattern Matching; 4. Efficient Data Structures; 5. Regularities in Words; 6. Text Compression; 7. Miscellaneous.

      Recently viewed products

      © 2026 Book Curl

        • American Express
        • Apple Pay
        • Diners Club
        • Discover
        • Google Pay
        • Maestro
        • Mastercard
        • PayPal
        • Shop Pay
        • Union Pay
        • Visa

        Login

        Forgot your password?

        Don't have an account yet?
        Create account