125 Problems in Text Algorithms: with Solutions

Main
Computers - Computer Science
125 Problems in Text Algorithms: with...

125 Problems in Text Algorithms: with Solutions

Name: 125 Problems in Text Algorithms: with Solutions
ISBN: 9781108869317

Maxime Crochemore, Thierry Lecroq, Wojciech Rytter

5.0 / 5.0

2 comments

How much do you like this book?

What’s the quality of the file?

Download the book for quality assessment

What’s the quality of the downloaded files?

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).

Categories:

Computers - Computer Science

Content Type:

Books

Year:

2021

Edition:

Publisher:

Cambridge University Press

Language:

english

Pages: