Store besparelser
Hurtig levering
Fri fragt over 499,-
Gemte
Log ind
0
Kurv
Kurv

125 Problems in Text Algorithms

- with Solutions
Engelsk Hardback

125 Problems in Text Algorithms

- with Solutions
Engelsk Hardback

813 kr
Tilføj til kurv
Sikker betaling
23 - 25 hverdage

Om denne bog
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).
Product detaljer
Sprog:
Engelsk
Sider:
320
ISBN-13:
9781108835831
Indbinding:
Hardback
Udgave:
ISBN-10:
110883583X
Udg. Dato:
1 jul 2021
Længde:
26mm
Bredde:
235mm
Højde:
158mm
Forlag:
Cambridge University Press
Oplagsdato:
1 jul 2021
Finder produkter...
Kategori sammenhænge