125 problems in text algorithms: with solutions
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...
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Weitere beteiligte Personen: | , |
| Format: | E-Book |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2021
|
| Links: | https://doi.org/10.1017/9781108835831 |
| Zusammenfassung: | 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). |
| Umfang: | 1 Online-Ressource (x, 334 Seiten) |
| ISBN: | 9781108869317 |
Internformat
MARC
| LEADER | 00000nam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ZDB-20-CTM-CR9781108869317 | ||
| 003 | UkCbUP | ||
| 005 | 20210705103621.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr|||||||||||| | ||
| 008 | 190913s2021||||enk o ||1 0|eng|d | ||
| 020 | |a 9781108869317 | ||
| 100 | 1 | |a Crochemore, Maxime |d 1947- | |
| 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-Ressource (x, 334 Seiten) | ||
| 336 | |b txt | ||
| 337 | |b c | ||
| 338 | |b cr | ||
| 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). | ||
| 700 | 1 | |a Lecroq, Thierry | |
| 700 | 1 | |a Rytter, Wojciech | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781108798853 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781108835831 |
| 966 | 4 | 0 | |l DE-91 |p ZDB-20-CTM |q TUM_PDA_CTM |u https://doi.org/10.1017/9781108835831 |3 Volltext |
| 912 | |a ZDB-20-CTM | ||
| 912 | |a ZDB-20-CTM | ||
| 049 | |a DE-91 | ||
Datensatz im Suchindex
| DE-BY-TUM_katkey | ZDB-20-CTM-CR9781108869317 |
|---|---|
| _version_ | 1825574046645878784 |
| adam_text | |
| any_adam_object | |
| author | Crochemore, Maxime 1947- |
| author2 | Lecroq, Thierry Rytter, Wojciech |
| author2_role | |
| author2_variant | t l tl w r wr |
| author_facet | Crochemore, Maxime 1947- Lecroq, Thierry Rytter, Wojciech |
| author_role | |
| author_sort | Crochemore, Maxime 1947- |
| author_variant | m c mc |
| building | Verbundindex |
| bvnumber | localTUM |
| collection | ZDB-20-CTM |
| format | eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01914nam a2200289 i 4500</leader><controlfield tag="001">ZDB-20-CTM-CR9781108869317</controlfield><controlfield tag="003">UkCbUP</controlfield><controlfield tag="005">20210705103621.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr||||||||||||</controlfield><controlfield tag="008">190913s2021||||enk o ||1 0|eng|d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781108869317</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Crochemore, Maxime</subfield><subfield code="d">1947-</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">125 problems in text algorithms</subfield><subfield code="b">with solutions</subfield><subfield code="c">Maxime Crochemore, Thierry Lecroq, Wojciech Rytter</subfield></datafield><datafield tag="246" ind1="3" ind2=" "><subfield code="a">One twenty five problems in text algorithms</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2021</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (x, 334 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="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).</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lecroq, Thierry</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rytter, Wojciech</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781108798853</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781108835831</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-91</subfield><subfield code="p">ZDB-20-CTM</subfield><subfield code="q">TUM_PDA_CTM</subfield><subfield code="u">https://doi.org/10.1017/9781108835831</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
| id | ZDB-20-CTM-CR9781108869317 |
| illustrated | Not Illustrated |
| indexdate | 2025-03-03T11:58:00Z |
| institution | BVB |
| isbn | 9781108869317 |
| language | English |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (x, 334 Seiten) |
| psigel | ZDB-20-CTM TUM_PDA_CTM ZDB-20-CTM |
| publishDate | 2021 |
| publishDateSearch | 2021 |
| publishDateSort | 2021 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Crochemore, Maxime 1947- 125 problems in text algorithms with solutions Maxime Crochemore, Thierry Lecroq, Wojciech Rytter One twenty five problems in text algorithms Cambridge Cambridge University Press 2021 1 Online-Ressource (x, 334 Seiten) txt c cr 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). Lecroq, Thierry Rytter, Wojciech Erscheint auch als Druck-Ausgabe 9781108798853 Erscheint auch als Druck-Ausgabe 9781108835831 |
| spellingShingle | Crochemore, Maxime 1947- 125 problems in text algorithms with solutions |
| title | 125 problems in text algorithms with solutions |
| title_alt | One twenty five problems in text algorithms |
| title_auth | 125 problems in text algorithms with solutions |
| title_exact_search | 125 problems in text algorithms with solutions |
| title_full | 125 problems in text algorithms with solutions Maxime Crochemore, Thierry Lecroq, Wojciech Rytter |
| title_fullStr | 125 problems in text algorithms with solutions Maxime Crochemore, Thierry Lecroq, Wojciech Rytter |
| title_full_unstemmed | 125 problems in text algorithms with solutions Maxime Crochemore, Thierry Lecroq, Wojciech Rytter |
| title_short | 125 problems in text algorithms |
| title_sort | 125 problems in text algorithms with solutions |
| title_sub | with solutions |
| work_keys_str_mv | AT crochemoremaxime 125problemsintextalgorithmswithsolutions AT lecroqthierry 125problemsintextalgorithmswithsolutions AT rytterwojciech 125problemsintextalgorithmswithsolutions AT crochemoremaxime onetwentyfiveproblemsintextalgorithms AT lecroqthierry onetwentyfiveproblemsintextalgorithms AT rytterwojciech onetwentyfiveproblemsintextalgorithms |