125 Problems in Text Algorithms

125 Problems in Text Algorithms
Author :
Publisher : Cambridge University Press
Total Pages : 345
Release :
ISBN-10 : 9781108871907
ISBN-13 : 1108871909
Rating : 4/5 (07 Downloads)

Book Synopsis 125 Problems in Text Algorithms by : Maxime Crochemore

Download or read book 125 Problems in Text Algorithms written by Maxime Crochemore and published by Cambridge University Press. This book was released on 2021-07-01 with total page 345 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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).


125 Problems in Text Algorithms Related Books