Algorithms on Strings
Uitgelicht
|
156,08 |
Naar shop
|
|
157,00 |
Naar shop
|
| VERGELIJK ALLE AANBIEDERS (2) | ||
Beschrijving
Bol
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.
Beschrijving
(2)
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.
AmazonPagina's: 392, Editie: Illustrated, Hardcover, Cambridge University Press
Productspecificaties
Prijshistorie
* Prijshistorie bevat geen data van Amazon.
Prijzen voor het laatst bijgewerkt op:
Gerelateerde resultaten
