125 problems in text algorithms:
"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 exerci...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
New York
Cambridge University Press
2021
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| 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)"-- |
| Beschreibung: | The numerals 125 are superimposed over "One twenty five" on the title page Includes bibliographical references and index 2105 |
| Beschreibung: | x, 334 Seiten Illustrationen, Diagramme |
| ISBN: | 9781108835831 9781108798853 |
Internformat
MARC
| LEADER | 00000nam a22000001c 4500 | ||
|---|---|---|---|
| 001 | BV047336262 | ||
| 003 | DE-604 | ||
| 005 | 20220707 | ||
| 007 | t | ||
| 008 | 210617s2021 xxua||| |||| 00||| eng d | ||
| 020 | |a 9781108835831 |c hardback |9 978-1-108-83583-1 | ||
| 020 | |a 9781108798853 |c paperback |9 978-1-108-79885-3 | ||
| 035 | |a (OCoLC)1236194515 | ||
| 035 | |a (DE-599)KXP1745732152 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a xxu |c XD-US | ||
| 049 | |a DE-739 |a DE-83 | ||
| 050 | 0 | |a QA76.9.T48 | |
| 082 | 0 | |a 005.13 | |
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 100 | 1 | |a Crochemore, Maxime |d 1947- |e Verfasser |0 (DE-588)121181820 |4 aut | |
| 245 | 1 | 0 | |a 125 problems in text algorithms |c Maxime Crochemore, Thierry Lecroq, Wojciech Rytter |
| 246 | 1 | 3 | |a One twenty five problems in text algorithms |
| 246 | 1 | 3 | |a One hundred twenty-five problems in text algorithms |
| 264 | 1 | |a New York |b Cambridge University Press |c 2021 | |
| 300 | |a x, 334 Seiten |b Illustrationen, Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a The numerals 125 are superimposed over "One twenty five" on the title page | ||
| 500 | |a Includes bibliographical references and index | ||
| 500 | |a 2105 | ||
| 520 | 3 | |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 | 7 | |a Mustererkennung |0 (DE-588)4040936-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Textkompression |0 (DE-588)4254794-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Matching |0 (DE-588)4212483-9 |2 gnd |9 rswk-swf |
| 653 | 0 | |a Text processing (Computer science) / Problems, exercises, etc | |
| 653 | 0 | |a Computer algorithms / Problems, exercises, etc | |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | 1 | |a Mustererkennung |0 (DE-588)4040936-3 |D s |
| 689 | 0 | 2 | |a Textkompression |0 (DE-588)4254794-5 |D s |
| 689 | 0 | 3 | |a Matching |0 (DE-588)4212483-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Lecroq, Thierry |d 1965- |e Verfasser |0 (DE-588)133503887 |4 aut | |
| 700 | 1 | |a Rytter, Wojciech |d 1948- |e Verfasser |0 (DE-588)172342201 |4 aut | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-1-108-86931-7 |
| 856 | 4 | 2 | |m Digitalisierung UB Passau - ADAM Catalogue Enrichment |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=032738772&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032738772 | ||
Datensatz im Suchindex
| _version_ | 1804182549547712512 |
|---|---|
| adam_text | Contents Preface page ix 1 The Very Basics of Stringology 1 2 Combinatorial Puzzles 1 Stringologic Proof of Fermat’s Little Theorem 2 Simple Case of Codicity Testing 3 Magic Squares and the Thue-Morse Word 4 Oldenburger-Kolakoski Sequence 5 Square-Free Game 6 Fibonacci Words and Fibonacci Numeration System 7 Wythoff’s Game and Fibonacci Word 8 Distinct Periodic Words 9 A Relative of the Thue-Morse Word 10 Thue-Morse Words and Sums of Powers 11 Conjugates and Rotations of Words 12 Conjugate Palindromes 13 Many Words with Many Palindromes 14 Short Superword of Permutations 15 Short Supersequence of Permutations 16 Skolem Words 17 Langford Words 18 From Lyndon Words to de Bruijn Words 3 Pattern Matching 19 Border Table 20 Shortest Covers 21 Short Borders 17 , 18 19 20 22 24 26 28 30 33 34 35 37 39 41 43 45 48 50 53 54 56 58 v
vi vii Contents 22 23 24 25 26 27 28 29 ЗО 31 32 33 34 35 36 37 38 39 40 41 42 43 44 Prefix Table Border Table to the Maximal Suffix Periodicity Test Strict Borders Delay of Sequential String Matching Sparse Matching Automaton Comparison-Effective String Matching Strict Border Table of the Fibonacci Word Words with Singleton Variables Order-Preserving Patterns Parameterised Matching Good-Suffix Table Worst Case of the Boyer-Moore Algorithm Turbo-BM Algorithm String Matching with Don’t Cares Cyclic Equivalence Simple Maximal Suffix Computation Self-Maximal Words Maximal Suffix and Its Period Critical Position of a Word Periods of Lyndon Word Prefixes Searching Zimin Words Searching Irregular 2D Patterns Efficient Data Structures 45 List Algorithm for Shortest Cover 46 Computing Longest Common Prefixes 47 Suffix Array to Suffix Tree 48 Linear Suffix Trie 49 Ternary Search Trie 50 Longest Common Factor of Two Words 51 Subsequence Automaton 52 Codicity Test 53 LPF Table 54 Sorting Suffixes of Thue-Morse Words 55 Bare Suffix Tree 56 Comparing Suffixes of a Fibonacci Word 57 Avoidability of Binary Words 58 Avoiding a Set of Words 60 62 65 67 70 72 74 76 78 81 83 85 88 90 92 93 96 98 100 103 105 107 110 111 112 113 115 119 122 124 126 128 130 134 137 139 141 144 59 60 61 62 63 64 65 66 67 68 69 70 71 Minimal Unique Factors Minimal Absent Words Greedy Superstring Shortest Common Superstring of Short Words Counting Factors by Length Counting Factors Covering a Position Longest Common-Parity Factors Word Square-Freeness with DBF Generic Words of Factor Equations Searching an Infinite
Word Perfect Words Dense Binary Words Factor Oracle Regularities in Words 72 Three Square Prefixes 73 Tight Bounds on Occurrences of Powers 74 Computing Runs on General Alphabets 75 Testing Overlaps in a Binary Word 76 Overlap-Free Game 77 Anchored Squares 78 Almost Square-Free Words 79 Binary Words with Few Squares 80 Building Long Square-Free Words 81 Testing Morphism Square-Freeness 82 Number of Square Factors in Labelled Trees 83 Counting Squares in Combs in Linear Time 84 Cubic Runs 85 Short Square and Local Period 86 The Number of Runs 87 Computing Runs on Sorted Alphabet 88 Periodicity and Factor Complexity 89 Periodicity of Morphic Words 90 Simple Anti-powers 91 Palindromic Concatenation of Palindromes 92 Palindrome Trees 93 Unavoidable Patterns 146 148 152 155 157 160 161 162 164 166 169 173 175 180 181 183 185 188 190 192 195 197 199 201 203 206 208 210 212 214 219 220 222 224 225 227
viii 6 7 Contents Text Compression 230 94 95 96 97 98 99 100 101 102 103 104 105 106 107 231 233 237 239 242 244 248 253 256 261 264 266 269 271 BW Transform of Thue -Morse Words BW Transform of Balanced Words ïn-place BW Transform Lempel֊Ziv Factorisation Lempel-Ziv-Welch Decoding Cost of a Huffman Code Length-Limited Huffman Coding Online Huffman Coding Run-Length Encoding A Compact Factor Automaton Compressed Matching in a Fibonacci Word Prediction by Partial Matching Compressing Suffix Arrays Compression Ratio of Greedy Superstrings Miscellaneous 275 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 276 278 280 282 283 286 288 290 292 295 298 300 302 304 306 309 311 314 Binary Pascal Words Self-Reproducing Words Weights of Factors Letter-Occurrence Differences Factoring with Border-Free Prefixes Primitivity Test for Unary Extensions Partially Commutative Alphabets Greatest Fixed-Density Necklace Period-Equivalent Binary Words Online Generation of de Bruijn Words Recursive Generation of de Bruijn Words Word Equations with Given Lengths of Variables Diverse Factors over a Three-Letter Alphabet Longest Increasing Subsequence Unavoidable Sets via Lyndon Words Synchronising Words Safe-Opening Words Superwords of Shortened Permutations Bibliography Index 318 332
|
| adam_txt |
Contents Preface page ix 1 The Very Basics of Stringology 1 2 Combinatorial Puzzles 1 Stringologic Proof of Fermat’s Little Theorem 2 Simple Case of Codicity Testing 3 Magic Squares and the Thue-Morse Word 4 Oldenburger-Kolakoski Sequence 5 Square-Free Game 6 Fibonacci Words and Fibonacci Numeration System 7 Wythoff’s Game and Fibonacci Word 8 Distinct Periodic Words 9 A Relative of the Thue-Morse Word 10 Thue-Morse Words and Sums of Powers 11 Conjugates and Rotations of Words 12 Conjugate Palindromes 13 Many Words with Many Palindromes 14 Short Superword of Permutations 15 Short Supersequence of Permutations 16 Skolem Words 17 Langford Words 18 From Lyndon Words to de Bruijn Words 3 Pattern Matching 19 Border Table 20 Shortest Covers 21 Short Borders 17 , 18 19 20 22 24 26 28 30 33 34 35 37 39 41 43 45 48 50 53 54 56 58 v
vi vii Contents 22 23 24 25 26 27 28 29 ЗО 31 32 33 34 35 36 37 38 39 40 41 42 43 44 Prefix Table Border Table to the Maximal Suffix Periodicity Test Strict Borders Delay of Sequential String Matching Sparse Matching Automaton Comparison-Effective String Matching Strict Border Table of the Fibonacci Word Words with Singleton Variables Order-Preserving Patterns Parameterised Matching Good-Suffix Table Worst Case of the Boyer-Moore Algorithm Turbo-BM Algorithm String Matching with Don’t Cares Cyclic Equivalence Simple Maximal Suffix Computation Self-Maximal Words Maximal Suffix and Its Period Critical Position of a Word Periods of Lyndon Word Prefixes Searching Zimin Words Searching Irregular 2D Patterns Efficient Data Structures 45 List Algorithm for Shortest Cover 46 Computing Longest Common Prefixes 47 Suffix Array to Suffix Tree 48 Linear Suffix Trie 49 Ternary Search Trie 50 Longest Common Factor of Two Words 51 Subsequence Automaton 52 Codicity Test 53 LPF Table 54 Sorting Suffixes of Thue-Morse Words 55 Bare Suffix Tree 56 Comparing Suffixes of a Fibonacci Word 57 Avoidability of Binary Words 58 Avoiding a Set of Words 60 62 65 67 70 72 74 76 78 81 83 85 88 90 92 93 96 98 100 103 105 107 110 111 112 113 115 119 122 124 126 128 130 134 137 139 141 144 59 60 61 62 63 64 65 66 67 68 69 70 71 Minimal Unique Factors Minimal Absent Words Greedy Superstring Shortest Common Superstring of Short Words Counting Factors by Length Counting Factors Covering a Position Longest Common-Parity Factors Word Square-Freeness with DBF Generic Words of Factor Equations Searching an Infinite
Word Perfect Words Dense Binary Words Factor Oracle Regularities in Words 72 Three Square Prefixes 73 Tight Bounds on Occurrences of Powers 74 Computing Runs on General Alphabets 75 Testing Overlaps in a Binary Word 76 Overlap-Free Game 77 Anchored Squares 78 Almost Square-Free Words 79 Binary Words with Few Squares 80 Building Long Square-Free Words 81 Testing Morphism Square-Freeness 82 Number of Square Factors in Labelled Trees 83 Counting Squares in Combs in Linear Time 84 Cubic Runs 85 Short Square and Local Period 86 The Number of Runs 87 Computing Runs on Sorted Alphabet 88 Periodicity and Factor Complexity 89 Periodicity of Morphic Words 90 Simple Anti-powers 91 Palindromic Concatenation of Palindromes 92 Palindrome Trees 93 Unavoidable Patterns 146 148 152 155 157 160 161 162 164 166 169 173 175 180 181 183 185 188 190 192 195 197 199 201 203 206 208 210 212 214 219 220 222 224 225 227
viii 6 7 Contents Text Compression 230 94 95 96 97 98 99 100 101 102 103 104 105 106 107 231 233 237 239 242 244 248 253 256 261 264 266 269 271 BW Transform of Thue -Morse Words BW Transform of Balanced Words ïn-place BW Transform Lempel֊Ziv Factorisation Lempel-Ziv-Welch Decoding Cost of a Huffman Code Length-Limited Huffman Coding Online Huffman Coding Run-Length Encoding A Compact Factor Automaton Compressed Matching in a Fibonacci Word Prediction by Partial Matching Compressing Suffix Arrays Compression Ratio of Greedy Superstrings Miscellaneous 275 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 276 278 280 282 283 286 288 290 292 295 298 300 302 304 306 309 311 314 Binary Pascal Words Self-Reproducing Words Weights of Factors Letter-Occurrence Differences Factoring with Border-Free Prefixes Primitivity Test for Unary Extensions Partially Commutative Alphabets Greatest Fixed-Density Necklace Period-Equivalent Binary Words Online Generation of de Bruijn Words Recursive Generation of de Bruijn Words Word Equations with Given Lengths of Variables Diverse Factors over a Three-Letter Alphabet Longest Increasing Subsequence Unavoidable Sets via Lyndon Words Synchronising Words Safe-Opening Words Superwords of Shortened Permutations Bibliography Index 318 332 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Crochemore, Maxime 1947- Lecroq, Thierry 1965- Rytter, Wojciech 1948- |
| author_GND | (DE-588)121181820 (DE-588)133503887 (DE-588)172342201 |
| author_facet | Crochemore, Maxime 1947- Lecroq, Thierry 1965- Rytter, Wojciech 1948- |
| author_role | aut aut aut |
| author_sort | Crochemore, Maxime 1947- |
| author_variant | m c mc t l tl w r wr |
| building | Verbundindex |
| bvnumber | BV047336262 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9.T48 |
| callnumber-search | QA76.9.T48 |
| callnumber-sort | QA 276.9 T48 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 134 |
| ctrlnum | (OCoLC)1236194515 (DE-599)KXP1745732152 |
| dewey-full | 005.13 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.13 |
| dewey-search | 005.13 |
| dewey-sort | 15.13 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03433nam a22005651c 4500</leader><controlfield tag="001">BV047336262</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220707 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">210617s2021 xxua||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781108835831</subfield><subfield code="c">hardback</subfield><subfield code="9">978-1-108-83583-1</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781108798853</subfield><subfield code="c">paperback</subfield><subfield code="9">978-1-108-79885-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1236194515</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)KXP1745732152</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">xxu</subfield><subfield code="c">XD-US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-739</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.9.T48</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.13</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Crochemore, Maxime</subfield><subfield code="d">1947-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)121181820</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">125 problems in text algorithms</subfield><subfield code="c">Maxime Crochemore, Thierry Lecroq, Wojciech Rytter</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">One twenty five problems in text algorithms</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">One hundred twenty-five problems in text algorithms</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2021</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">x, 334 Seiten</subfield><subfield code="b">Illustrationen, Diagramme</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">The numerals 125 are superimposed over "One twenty five" on the title page</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">2105</subfield></datafield><datafield tag="520" ind1="3" 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="650" ind1="0" ind2="7"><subfield code="a">Mustererkennung</subfield><subfield code="0">(DE-588)4040936-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Textkompression</subfield><subfield code="0">(DE-588)4254794-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Matching</subfield><subfield code="0">(DE-588)4212483-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Text processing (Computer science) / Problems, exercises, etc</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Computer algorithms / Problems, exercises, etc</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Mustererkennung</subfield><subfield code="0">(DE-588)4040936-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Textkompression</subfield><subfield code="0">(DE-588)4254794-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Matching</subfield><subfield code="0">(DE-588)4212483-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lecroq, Thierry</subfield><subfield code="d">1965-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)133503887</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rytter, Wojciech</subfield><subfield code="d">1948-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)172342201</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-1-108-86931-7</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Passau - ADAM Catalogue Enrichment</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=032738772&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032738772</subfield></datafield></record></collection> |
| id | DE-604.BV047336262 |
| illustrated | Illustrated |
| index_date | 2024-07-03T17:32:46Z |
| indexdate | 2024-07-10T09:09:19Z |
| institution | BVB |
| isbn | 9781108835831 9781108798853 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032738772 |
| oclc_num | 1236194515 |
| open_access_boolean | |
| owner | DE-739 DE-83 |
| owner_facet | DE-739 DE-83 |
| physical | x, 334 Seiten Illustrationen, Diagramme |
| publishDate | 2021 |
| publishDateSearch | 2021 |
| publishDateSort | 2021 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Crochemore, Maxime 1947- Verfasser (DE-588)121181820 aut 125 problems in text algorithms Maxime Crochemore, Thierry Lecroq, Wojciech Rytter One twenty five problems in text algorithms One hundred twenty-five problems in text algorithms New York Cambridge University Press 2021 x, 334 Seiten Illustrationen, Diagramme txt rdacontent n rdamedia nc rdacarrier The numerals 125 are superimposed over "One twenty five" on the title page Includes bibliographical references and index 2105 "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)"-- Mustererkennung (DE-588)4040936-3 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Textkompression (DE-588)4254794-5 gnd rswk-swf Matching (DE-588)4212483-9 gnd rswk-swf Text processing (Computer science) / Problems, exercises, etc Computer algorithms / Problems, exercises, etc Algorithmus (DE-588)4001183-5 s Mustererkennung (DE-588)4040936-3 s Textkompression (DE-588)4254794-5 s Matching (DE-588)4212483-9 s DE-604 Lecroq, Thierry 1965- Verfasser (DE-588)133503887 aut Rytter, Wojciech 1948- Verfasser (DE-588)172342201 aut Erscheint auch als Online-Ausgabe 978-1-108-86931-7 Digitalisierung UB Passau - ADAM Catalogue Enrichment application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=032738772&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Crochemore, Maxime 1947- Lecroq, Thierry 1965- Rytter, Wojciech 1948- 125 problems in text algorithms Mustererkennung (DE-588)4040936-3 gnd Algorithmus (DE-588)4001183-5 gnd Textkompression (DE-588)4254794-5 gnd Matching (DE-588)4212483-9 gnd |
| subject_GND | (DE-588)4040936-3 (DE-588)4001183-5 (DE-588)4254794-5 (DE-588)4212483-9 |
| title | 125 problems in text algorithms |
| title_alt | One twenty five problems in text algorithms One hundred twenty-five problems in text algorithms |
| title_auth | 125 problems in text algorithms |
| title_exact_search | 125 problems in text algorithms |
| title_exact_search_txtP | 125 problems in text algorithms |
| title_full | 125 problems in text algorithms Maxime Crochemore, Thierry Lecroq, Wojciech Rytter |
| title_fullStr | 125 problems in text algorithms Maxime Crochemore, Thierry Lecroq, Wojciech Rytter |
| title_full_unstemmed | 125 problems in text algorithms Maxime Crochemore, Thierry Lecroq, Wojciech Rytter |
| title_short | 125 problems in text algorithms |
| title_sort | 125 problems in text algorithms |
| topic | Mustererkennung (DE-588)4040936-3 gnd Algorithmus (DE-588)4001183-5 gnd Textkompression (DE-588)4254794-5 gnd Matching (DE-588)4212483-9 gnd |
| topic_facet | Mustererkennung Algorithmus Textkompression Matching |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=032738772&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT crochemoremaxime 125problemsintextalgorithms AT lecroqthierry 125problemsintextalgorithms AT rytterwojciech 125problemsintextalgorithms AT crochemoremaxime onetwentyfiveproblemsintextalgorithms AT lecroqthierry onetwentyfiveproblemsintextalgorithms AT rytterwojciech onetwentyfiveproblemsintextalgorithms AT crochemoremaxime onehundredtwentyfiveproblemsintextalgorithms AT lecroqthierry onehundredtwentyfiveproblemsintextalgorithms AT rytterwojciech onehundredtwentyfiveproblemsintextalgorithms |