Épuisé, mais très demandé!
Paramètres
- 392pages
- 14 heures de lecture
En savoir plus sur le livre
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 will be an important resource for students and researchers in theoretical computer science, computational linguistics, computational biology, and software engineering.
Achat du livre
Algorithms on Strings, Maxime Crochemore, Christophe Hancart, Thierry Lecroq
- Langue
- Année de publication
- 2007
- product-detail.submit-box.info.binding
- (rigide)
Nous vous informerons par e-mail dès que nous l’aurons retrouvé.
Modes de paiement
Il manque plus que ton avis ici.
- Titre
- Algorithms on Strings
- Langue
- Anglais
- Éditeur
- Cambridge University Press
- Publié
- 2007
- Format
- rigide
- Pages
- 392
- ISBN10
- 0521848997
- ISBN13
- 9780521848992
- Séries
- Évaluation
- 4,35 sur 5
- Description
- 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 will be an important resource for students and researchers in theoretical computer science, computational linguistics, computational biology, and software engineering.