Algorithms on Strings

AvMaxime Crochemore,Christophe Hancart

Häftad, Engelska, 2014

649 kr

Beställningsvara. Skickas inom 5-8 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

Inbunden

1 919 kr

Beskrivning

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.

Produktinformation

Utgivningsdatum:2014-11-06
Mått:152 x 229 x 21 mm
Vikt:520 g
Format:Häftad
Språk:Engelska
Antal sidor:392
Förlag:Cambridge University Press
ISBN:9781107670990

Utforska kategorier

Programmeringsböcker inom Data och IT
Programvaruutveckling inom Data och IT

Mer om författaren

Professor Maxime Crochemore received his PhD in 1978 and his Doctorat d'état 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-Vallée 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 Orléans in 1992. He is now a professor in the Department of Computer Science at the University of Rouen.

Recensioner i media

'… 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

Innehållsförteckning

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.