Text

125 Problems in Text Algorithms: with Solutions

---

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

---

Availability

No copy data

Detail Information

Series Title

-

Call Number

-

Publisher

Amsterdam : Cambridge University Press., 2021

Collation

-

Language

English

ISBN/ISSN

9781108869317

Classification

NONE

Content Type

-

Media Type

-

Carrier Type

-

Edition

-

Subject(s)

-

Specific Detail Info

-

Statement of Responsibility

Maxime Crochemore, Thierry Lecroq, Wojciech Rytter

Other Information

Cataloger

Kholif Basri

Source

https://doi.org/10.1017/9781108835831

Validator

-

Digital Object Identifier (DOI)

-

Journal Volume

-

Journal Issue

-

Subtitle

-

Parallel Title

-

Other version/related

File Attachment

Comments

---

You must be logged in to post a comment