000 02173nam a2200313 i 4500
003 IN-BdCUP
005 20250103125020.0
008 190913s2021||||enk o ||1 0|eng|d
020 _a9781108869317 (ebook)
_z9781108835831 (hardback);9781108798853 (paperback)
040 _aIN-BdCUP
_beng
_cIN-BdCUP
_erda
041 _aeng
050 _aQA76.9.T48
_bC758 2021
082 _a5.13
100 _aCrochemore, Maxime
_eAuthor
245 0 _a125 problems in text algorithms :
_bwith solutions /
_cMaxime Crochemore, Thierry Lecroq, Wojciech Rytter.
264 _aCambridge :
_bCambridge University Press,
_c2021
300 _a1 online resource (x, 334 pages) :
_bdigital, PDF file(s).
336 _atext
_btxt
337 _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 _aText processing (Computer science)
_aComputer algorithms
700 _aLecroq, Thierry,
_eauthor.
700 _aRytter, Wojciech,
_eauthor.
776 _iPrint version:
_z9781108869317
856 _3Electronic Book Resource
_uhttps://doi.org/10.1017/9781108835831
942 _2ddc
_cE
999 _c54651
_d54651