My Account
Log in Registration
All
Cart
Highlights
Fiction Books
Non-Fiction Books
Children's Books
Rare Books
Music
DVD & Blu-Ray
Video Games
Category
Wishlists
Cart
All
Free Shipping in Australia
Trustpilot
Proud to be B-Corp

Algorithms on Strings Maxime Crochemore

Algorithms on Strings By Maxime Crochemore

Algorithms on Strings by Maxime Crochemore

Reviews:
$292.19
Condition - New
Only 2 left
New

Summary

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.

Algorithms on Strings Summary

Algorithms on Strings by Maxime Crochemore

The book is intended for lectures on string processes and pattern matching in Master's courses of computer science and software engineering curricula. The details of algorithms are given with correctness proofs and complexity analysis, which make them ready to implement. Algorithms are described in a C-like language. The book is also a reference for students in computational linguistics or computational biology. It presents examples of questions related to the automatic processing of natural language, to the analysis of molecular sequences, and to the management of textual databases.

Algorithms on Strings Reviews

' perfect for lectures on 'stringology', for graduate students as a reference on the topic and for appliers in linguistic or molecular biology ' Acta Scientiarum Mathematicarum
'This is a good book on string matching and other related algorithms, especially from the theoretical point of view. The material is well explained and the treatment of the subjects covered is quite complete. Overall, this book will be of interest to people doing research in combinatorial biology and computational linguistics.' Mathematical Reviews

About Maxime Crochemore

Professor Maxime Crochemore received his PhD in 1978 and his Doctorat d'etat in 1983 at the University of Rouen. He got his first professorship position at the University of Paris-Nord in 1975 where he acted as President of the Department of Mathematics and Computer Science for two years. He became professor at the University Paris 7 in 1989 and was involved in the creation of the University of Marne-la-Vallee where he is presently Professor. He also created the Computer Science research laboratory of this university in 1991, which has now more than fifty permanent researchers. He was the director of the laboratory until 2005. Professor Crochemore is Senior Research Fellow at King's College London since 2002. Christophe Hancart received his PhD in Computer Science from the University of Paris 7, France. He is now an assistant professor in the Department of Computer Science at the University of Rouen. Thierry Lecroq received his PhD in Computer Science from the University of Orleans in 1992. He is now a professor in the Department of Computer Science at the University of Rouen.

Table of Contents

1. Tools; 2. Pattern matching automata; 3. String searching with a sliding window; 4. Suffix arrays; 5. Structures for indexes; 6. Indexes; 7. Alignments; 8. Approximate patterns; 9. Local periods.

Additional information

NPB9780521848992
9780521848992
0521848997
Algorithms on Strings by Maxime Crochemore
Maxime Crochemore
New
Hardback
Cambridge University Press
2007-04-09
392
N/A
Book picture is for illustrative purposes only, actual binding, cover or edition may vary.
This is a new book - be the first to read this copy. With untouched pages and a perfect binding, your brand new copy is ready to be opened for the first time

Customer Reviews - Algorithms on Strings