Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Algorithms on Strings - Maxime Crochemore, Christophe Hancart, Thierry Lecroq

Algorithms on Strings

Buch | Softcover
392 Seiten
2014
Cambridge University Press (Verlag)
978-1-107-67099-0 (ISBN)
CHF 73,30 inkl. MwSt
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 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.

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.

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.

Verlagsort Cambridge
Sprache englisch
Maße 152 x 229 mm
Gewicht 520 g
Themenwelt Mathematik / Informatik Informatik Software Entwicklung
Informatik Theorie / Studium Algorithmen
Mathematik / Informatik Mathematik
Naturwissenschaften Biologie
Technik Umwelttechnik / Biotechnologie
ISBN-10 1-107-67099-3 / 1107670993
ISBN-13 978-1-107-67099-0 / 9781107670990
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
IT zum Anfassen für alle von 9 bis 99 – vom Navi bis Social Media

von Jens Gallenbacher

Buch | Softcover (2021)
Springer (Verlag)
CHF 41,95
Interlingua zur Gewährleistung semantischer Interoperabilität in der …

von Josef Ingenerf; Cora Drenkhahn

Buch | Softcover (2023)
Springer Fachmedien (Verlag)
CHF 46,15