125 Problems in Text Algorithms. With Solutions

Par : Maxime Crochemore, Thierry Lecroq, Wojciech Rytter
Formats :
Grand Format
43,80 €
  • Nombre de pages334
  • FormatGrand Format
  • PrésentationBroché
  • Poids0.508 kg
  • Dimensions15,3 cm × 22,8 cm × 2,0 cm
  • ISBN978-1-108-79885-3
  • EAN9781108798853
  • Date de parution01/07/2021
  • ÉditeurCambridge University Press

Résumé

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

A propos de Maxime Crochemore

Maxime CROCHEMORE is Emeritus Professor at Université Gustave-Eiffel and at 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 hooks on the subject. Thierry LECROD 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 coordinators of the working group in Stringology of the French CNRS for more than 10 years. Wojciech RYTTER is Professor at the 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 Analysis of Algorithms and Data Structures. He is a member of Academia Europaea.
Découvrir l'auteur