Verwandte Artikel zu Algorithms on Strings Hardback
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Über die Autorinnen und Autoren
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
EUR 103,81
EUR 9,16 für den Versand von Vereinigtes Königreich nach USA
Versandziele, Kosten & DauerNeu kaufen
Diesen Artikel anzeigen
EUR 158,23
EUR 13,72 für den Versand von Vereinigtes Königreich nach USA
Versandziele, Kosten & Dauer
Suchergebnisse für Algorithms on Strings Hardback
Foto des Verkäufers
Algorithms on Strings.
Verlag:
Cambridge University Press, 2001
ISBN 10: 0521848997
ISBN 13: 9780521848992
Gebraucht
Hardcover
Anbieter: Plurabelle Books Ltd, Cambridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: Good. viii 383p hardback, illustrated blue boards, a fresh copy, clean firm, in excellent condition Language: English. Artikel-Nr. 189123
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Algorithms on Strings
Verlag:
Cambridge University Press, 2007
ISBN 10: 0521848997
ISBN 13: 9780521848992
Gebraucht
Hardcover
Anbieter: Ammareal, Morangis, Frankreich
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: Bon. Ancien livre de bibliothèque avec équipements. Edition 2007. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Good. Former library book. Edition 2007. Ammareal gives back up to 15% of this item's net price to charity organizations. Artikel-Nr. G-740-111
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Algorithms on Strings
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In English. Artikel-Nr. ria9780521848992_new
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Algorithms on Strings
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Artikel-Nr. 9780521848992
Anzahl: 1 verfügbar