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. The details of algorithms are given with correctness proofs and complexity analysis, which make them ready to implement. Algorithms are describe...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Beteilige Person: Crochemore, Maxime 1947-
Weitere beteiligte Personen: Hancart, Christophe 1964-, Lecroq, Thierry
Format: E-Book
Sprache:Englisch
Veröffentlicht: Cambridge Cambridge University Press 2007
Links:https://doi.org/10.1017/CBO9780511546853
Zusammenfassung: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.
Umfang:1 Online-Ressource (viii, 383 Seiten)
ISBN:9780511546853