125 problems in text algorithms : / Maxime Crochemore, Thierry Lecroq, Wojciech Rytter.

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).

Gespeichert in:
Elektronisch E-Book
Bibliographische Detailangaben
ParalleltitelOne twenty five problems in text algorithms
Person(en) Crochemore, Maxime, 1947- (verfasst von), Lecroq, Thierry (verfasst von), Rytter, Wojciech (verfasst von)
Ort, Verlag, Jahr Cambridge : Cambridge University Press , 2021
Umfang1 online resource (x, 334 pages) : : digital, PDF file(s).
ISBN1-108-87190-9
1-108-86448-1
1-108-86931-9
SpracheEnglisch
ZusatzinfoTitle from publisher's bibliographic system (viewed on 11 Jun 2021).
Online-ZugangCambridge ebooks EBS 2024

Bei Problemen beim Zugriff auf diese Online-Quelle beachten Sie unsere Hinweise zum Zugriff auf lizenzierte Angebote von außerhalb des Campus.

MARC

LEADER 00000nam a2200000 i 4500
001 99370853322906441
005 20210705103621.0
006 m|||||o||d||||||||
007 cr||||||||||||
008 190913s2021||||enk o ||1 0|eng|d
020 |a 1-108-87190-9 
020 |a 1-108-86448-1 
020 |a 1-108-86931-9 
035 |a (CKB)4100000011953079 
035 |a (UkCbUP)CR9781108869317 
035 |a (MiAaPQ)EBC6868812 
035 |a (Au-PeEL)EBL6868812 
035 |a (PPN)256033145 
035 |a (EXLCZ)994100000011953079 
040 |a UkCbUP  |b eng  |e rda  |c UkCbUP 
050 0 0 |a QA76.9.T48  |b C758 2021 
082 0 0 |a 005.13  |2 23 
100 1 |a Crochemore, Maxime,  |d 1947-  |e author. 
245 1 0 |a 125 problems in text algorithms :  |b with solutions /  |c Maxime Crochemore, Thierry Lecroq, Wojciech Rytter. 
246 3 |a One twenty five problems in text algorithms 
264 1 |a Cambridge :  |b Cambridge University Press,  |c 2021. 
300 |a 1 online resource (x, 334 pages) :  |b digital, PDF file(s). 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
500 |a Title from publisher's bibliographic system (viewed on 11 Jun 2021). 
520 |a 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). 
650 0 |a Text processing (Computer science)  |v Problems, exercises, etc. 
650 0 |a Computer algorithms  |v Problems, exercises, etc. 
776 |z 1-108-83583-X 
700 1 |a Lecroq, Thierry,  |e author. 
700 1 |a Rytter, Wojciech,  |e author. 
906 |a BOOK 
MAN |a false 
POR |0 2021-06-28 00:37:54 Europe/Berlin  |l Cambridge University Press  |y 2021-06-28 00:37:54 Europe/Berlin  |2 https://eu04.alma.exlibrisgroup.com/view/uresolver/49HBZ_BIE/openurl?u.ignore_date_coverage=true&portfolio_pid=53333029020006442&Force_direct=true  |u Cambridge University Press E-Books EBS  |a 53333029020006442  |1 2021-06-27 22:37:54  |k false  |r 61325881610006442  |t Cambridge EBS  |s Cambridge ebooks EBS 2024  |c param  |v BIE-36100  |5 62325881600006442  |d https://hbz-network.userservices.exlibrisgroup.com/view/uresolver/49HBZ_BIE/openurl?u.ignore_date_coverage=true&rft.mms_id=991025859269306442  |b Available  |q 615280000000001967  |e BOOK  |8 53333029020006442 
035 |a (49HBZ_BIE)991025859269306442 
035 |a (49HBZ_NETWORK)99370853322906441