125 Problems in Text Algorithms
with Solutions
Published on 16. June 2021
978-1-108-86448-0 (ISBN)
Description
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).
More details
Language
English
Place of publication
Cambridge
United Kingdom
Target group
Professional and scholarly
Illustrations
Worked examples or Exercises
File size
6,13 MB
ISBN-13
978-1-108-86448-0 (9781108864480)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
Book
07/2021
Cambridge University Press
€49.50
Shipment within 15-20 days
Book
07/2021
Cambridge University Press
€114.60
Shipment within 15-20 days
Content
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.
