Store besparelser
Hurtig levering
Gemte
Log ind
0
Kurv
Kurv

125 Problems in Text Algorithms

- with Solutions

125 Problems in Text Algorithms

- with Solutions
Tjek vores konkurrenters priser
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).
Tjek vores konkurrenters priser
Normalpris
kr 402
Fragt: 39 kr
6 - 8 hverdage
20 kr
Pakkegebyr
God 4 anmeldelser på
Tjek vores konkurrenters priser
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).
Produktdetaljer
Sprog: Engelsk
Sider: 344
ISBN-13: 9781108798853
Indbinding: Paperback
Udgave:
ISBN-10: 1108798853
Udg. Dato: 1 jul 2021
Længde: 26mm
Bredde: 228mm
Højde: 153mm
Forlag: Cambridge University Press
Oplagsdato: 1 jul 2021
Forfatter(e) Thierry Lecroq, Maxime Crochemore, Wojciech Rytter


Kategori Algoritmer og datastrukturer


ISBN-13 9781108798853


Sprog Engelsk


Indbinding Paperback


Sider 344


Udgave


Længde 26mm


Bredde 228mm


Højde 153mm


Udg. Dato 1 jul 2021


Oplagsdato 1 jul 2021


Forlag Cambridge University Press

Kategori sammenhænge