Omschrijving

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 s

Kenmerken

Artikelnummer9300000010131945
EAN9781108835831
CategorieEducational Books
ProductgroepBoeken
SegmentTextual/Printed/Reference Materials
Prijs Nederland€ 92,99
Prijs België€ 92,99
Verzendkosten NLGratis
Verzendkosten BEGratis
Levertijd NederlandOver 15 dagen
Levertijd BelgiëOver 16 dagen
VerkoperPartner

125 Problems in Text Algorithms bestellen bij snelkeus

Koop 125 Problems in Text Algorithms van Onbekend online in de categorie Educational Books. Prijs € 92,99, levering in Nederland · Over 15 dagen.