TY - BOOK ID - 96665501 TI - 125 problems in text algorithms : with solutions AU - Crochemore, Maxime AU - Lecroq, Thierry AU - Rytter, Wojciech PY - 2021 SN - 1108869319 1108871909 1108864481 PB - Cambridge : Cambridge University Press, DB - UniCat KW - Text processing (Computer science) KW - Computer algorithms KW - Algorithms KW - Processing, Text (Computer science) KW - Database management KW - Electronic data processing KW - Information storage and retrieval systems KW - Word processing UR - https://www.unicat.be/uniCat?func=search&query=sysid:96665501 AB - 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). ER -