He got his first professorship position at the University of Paris-Nord in where he acted as President of the Department of Mathematics and Computer Science for two years. He also created the Computer Science research laboratory of this university in , which has now more than fifty permanent researchers. He was the director of the laboratory until Algorithms on Strings. The book is intended for lectures on string processes and pattern matching in Master's courses of computer science and software engineering curricula.
|Published (Last):||15 August 2006|
|PDF File Size:||7.27 Mb|
|ePub File Size:||11.83 Mb|
|Price:||Free* [*Free Regsitration Required]|
Goodreads helps you keep track of books you want to read. Want to Read saving…. Want to Read Currently Reading Read. Other editions. Enlarge cover. Error rating book. Refresh and try again. Open Preview See a Problem? Details if other :. Thanks for telling us about the problem. Return to Book Page. Preview — Algorithms on Strings by Maxime Crochemore.
Algorithms on Strings by Maxime Crochemore. This text and reference on string processes and pattern matching presents examples related to the automatic processing of natural language, to the analysis of molecular sequences and to the management of textual databases.
Algorithms are described in a C-like language, with correctness proofs and complexity analysis, to make them ready to implement. The book will be an imp This text and reference on string processes and pattern matching presents examples related to the automatic processing of natural language, to the analysis of molecular sequences and to the management of textual databases.
The book will be an important resource for students and researchers in theoretical computer science, computational linguistics, computational biology, and software engineering. Get A Copy. Hardcover , pages. More Details Original Title. Other Editions 4. Friend Reviews. To see what your friends thought of this book, please sign up. To ask other readers questions about Algorithms on Strings , please sign up.
Be the first to ask a question about Algorithms on Strings. Lists with This Book. This book is not yet featured on Listopia. Community Reviews. Showing Average rating 4. Rating details. More filters. Sort order. Start your review of Algorithms on Strings. Dec 28, Ushan rated it really liked it Shelves: computer-science. Different variants of the Boyer-Moore algorithm, suffix arrays, suffix trees, and the like.
It never crossed my mind before that if you do binary search in an array, and arrive at an element, there is a unique sequence of low bounds and high bounds that got you there; using this fact, it is possible to preprocess a sorted array of strings so that searching for an element in it will be asymptotically faster than simple binary search. Nov 09, Nick Black rated it it was amazing Shelves: textbook-as-literature , getoutofmydreams-andintomythesis , likely-reread. This is the new best book on string algorithms, replacing Navarro's Flexible Pattern Matching in Strings at the top.
One of the best computer science textbooks I've ever seen. If y This is the new best book on string algorithms, replacing Navarro's Flexible Pattern Matching in Strings at the top. If you do string algorithms, this ought be the first book on your shelf.
I bit the bullet and grabbed a new copy -- I didn't want to close without securing what promises to be a rare and exquisite treat. Maxime Crochemore link de-Gaullized for your pleasure is certifiably: da man, and a delighted stringalg community has been waiting for this with breath bated.
Crochemore published in my favorite text on combinatorial matching, Jewels of Stringology with Wojciech Rytter. Anyway, this is sure to be an epic treatment of my all-time most beloved area of algorithms, with likely applications to my day-to-day work both in the laboratory and at the office. Sep 11, Tim Dumol rated it it was amazing Shelves: algorithms , stringology.
Formal and rigorous look at string algorithms. Fizz rated it really liked it Dec 26, Subhajit Das rated it really liked it Dec 07, Anh Le rated it it was amazing Mar 18, Fang-rui Song rated it really liked it Jul 20, Yu-Han Lyu rated it it was amazing Mar 04, Nitin Gupta rated it really liked it Jan 17, John rated it really liked it Sep 30, Georgi Sokolov rated it it was amazing Jan 04, Jake rated it it was amazing Sep 05, Alex Radzie rated it it was amazing Mar 22, Desiderata marked it as to-read Oct 22, Gerard marked it as to-read Dec 17, Sudhir Kumar marked it as to-read Aug 16, Himanshu marked it as to-read Nov 10, Duncan marked it as to-read Mar 30, Aniruddha Dutta added it Apr 06, Andy Legkiy marked it as to-read Jan 04, Rashmi Wadbude added it Mar 11, Karl marked it as to-read Jul 01, Nishant marked it as to-read Aug 06, Homoionym added it Aug 18, Nik marked it as to-read Feb 11, Rado added it Apr 28, Abhijit marked it as to-read May 05, Arun marked it as to-read Sep 30, Ehnaton marked it as to-read Oct 11, Robin Sharma marked it as to-read Feb 03, Paul Leopardi added it May 11, Alexander Ryabov marked it as to-read Dec 11, Vector Shaw marked it as to-read Dec 20, There are no discussion topics on this book yet.
About Maxime Crochemore. Maxime Crochemore. Books by Maxime Crochemore. As dedicated readers already know, some of the best and most innovative stories on the shelves come from the constantly evolving realm of young ad Read more Trivia About Algorithms on Str No trivia or quizzes yet. Welcome back. Just a moment while we sign you in to your Goodreads account.
Algorithms on Strings