000 02407nam a2200385 i 4500
001 CR9781108869317
003 UkCbUP
005 20240802171203.0
006 m|||||o||d||||||||
007 cr||||||||||||
008 190913s2021||||enk o ||1 0|eng|d
020 _a9781108869317 (ebook)
020 _z9781108835831 (hardback)
020 _z9781108798853 (paperback)
040 _aUkCbUP
_beng
_erda
_cUkCbUP
050 0 0 _aQA76.9.T48
_bC758 2021
082 0 0 _a005.13
_223
100 1 _aCrochemore, Maxime,
_d1947-
_eauthor.
245 1 0 _a125 problems in text algorithms :
_bwith solutions /
_cMaxime Crochemore, Thierry Lecroq, Wojciech Rytter.
246 3 _aOne twenty five problems in text algorithms
264 1 _aCambridge :
_bCambridge University Press,
_c2021.
300 _a1 online resource (x, 334 pages) :
_bdigital, PDF file(s).
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
500 _aTitle from publisher's bibliographic system (viewed on 11 Jun 2021).
520 _aString 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).
650 0 _aText processing (Computer science)
_vProblems, exercises, etc.
650 0 _aComputer algorithms
_vProblems, exercises, etc.
700 1 _aLecroq, Thierry,
_eauthor.
700 1 _aRytter, Wojciech,
_eauthor.
776 0 8 _iPrint version:
_z9781108835831
856 4 0 _uhttps://doi.org/10.1017/9781108835831
942 _2ddc
_cEB
999 _c9130
_d9130