/

125 Problems in Text Algorithms with Solutions

Crochemore Maxime Lecroq Thierry Rytter Wojciech
Heftet / 2021 / Engelsk

Produktdetaljer

ISBN
9781108798853
Publisert
2021-07-01
Utgiver
Vendor
Cambridge University Press
Vekt
500 gr
Høyde
227 mm
Bredde
150 mm
Dybde
19 mm
Aldersnivå
P, 06
Språk
Product language
Engelsk
Format
Product format
Heftet
Antall sider
344

Forfatter
Crochemore Maxime
Lecroq Thierry
Rytter Wojciech

Biographical note

Maxime Crochemore is Emeritus Professor of Université Gustave-Eiffel and of King's College London. He holds an Honorary Doctorate from the University of Helsinki. He is the author of more than 200 articles on algorithms on strings and their applications, and co-author of several books on the subject. Thierry Lecroq is Professor in the Department of Computer Science at the University of Rouen Normandy (France). He is currently head of the research team 'Information Processing in Biology and Health' of the 'Laboratory of Computer Science, Information Processing and System'. He has been one of the coordinator of the working group in Stringology of the French CNRS for more than 10 years. Wojciech Rytter is Professor of University of Warsaw. He is the author of a large number of publications on automata, formal languages, parallel algorithms and algorithms on texts. He is a co-author of several books on these subjects, including 'Efficient Parallel Algorithms', 'Text Algorithms' and 'Analysis of algorithms and data structures'. He is a member of Academia Europaea.

125 Problems in Text Algorithms with Solutions

Crochemore Maxime Lecroq Thierry Rytter Wojciech
Heftet / 2021 / Engelsk
Crochemore Maxime Lecroq Thierry Rytter Wojciech
Heftet / 2021 / Engelsk
Nettpris:
573,-
Laveste pris siste 30 dager: 573,-
Levering 7-20 dager
+
-
+
-
Klikk og hent
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).
Les mer
1. The Very Basics of Stringology; 2. Combinatorial Puzzles; 3. Pattern Matching; 4. Efficient Data Structures; 5. Regularities in Words; 6. Text Compression; 7. Miscellaneous.
Worked problems offer an interesting way to learn and practice with key concepts of string algorithms and combinatorics on words.

Relaterte produkter

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).
Les mer
1. The Very Basics of Stringology; 2. Combinatorial Puzzles; 3. Pattern Matching; 4. Efficient Data Structures; 5. Regularities in Words; 6. Text Compression; 7. Miscellaneous.
Worked problems offer an interesting way to learn and practice with key concepts of string algorithms and combinatorics on words.

Produktdetaljer

ISBN
9781108798853
Publisert
2021-07-01
Utgiver
Vendor
Cambridge University Press
Vekt
500 gr
Høyde
227 mm
Bredde
150 mm
Dybde
19 mm
Aldersnivå
P, 06
Språk
Product language
Engelsk
Format
Product format
Heftet
Antall sider
344

Forfatter
Crochemore Maxime
Lecroq Thierry
Rytter Wojciech

Biographical note

Maxime Crochemore is Emeritus Professor of Université Gustave-Eiffel and of King's College London. He holds an Honorary Doctorate from the University of Helsinki. He is the author of more than 200 articles on algorithms on strings and their applications, and co-author of several books on the subject. Thierry Lecroq is Professor in the Department of Computer Science at the University of Rouen Normandy (France). He is currently head of the research team 'Information Processing in Biology and Health' of the 'Laboratory of Computer Science, Information Processing and System'. He has been one of the coordinator of the working group in Stringology of the French CNRS for more than 10 years. Wojciech Rytter is Professor of University of Warsaw. He is the author of a large number of publications on automata, formal languages, parallel algorithms and algorithms on texts. He is a co-author of several books on these subjects, including 'Efficient Parallel Algorithms', 'Text Algorithms' and 'Analysis of algorithms and data structures'. He is a member of Academia Europaea.

Relaterte produkter