Épuisé, mais très demandé!
En savoir plus sur le livre
String matching is a very important subject in the wider domain of text processing. It consists of finding one, or more generally, all the occurrences of a string (more generally called a pattern) in a text. The Handbook of Exact String Matching Algorithms presents 38 methods for solving this problem. For each, it gives the main features, a description, its C code, an example and references.
Achat du livre
Handbook of Exact String Matching Algorithms, Christian Charras, Thierry Lecroq
- Langue
- Année de publication
- 2004
- product-detail.submit-box.info.binding
- (souple)
Nous vous informerons par e-mail dès que nous l’aurons retrouvé.
Modes de paiement
Il manque plus que ton avis ici.
- Titre
- Handbook of Exact String Matching Algorithms
- Langue
- Anglais
- Auteurs
- Christian Charras, Thierry Lecroq
- Éditeur
- King's College Publications
- Publié
- 2004
- Format
- souple
- Pages
- 256
- ISBN10
- 0954300645
- ISBN13
- 9780954300647
- Séries
- Mots clés
- Nonfiction, Science et Mathématiques, Mathématiques
- Évaluation
- 4,35 sur 5
- Description
- String matching is a very important subject in the wider domain of text processing. It consists of finding one, or more generally, all the occurrences of a string (more generally called a pattern) in a text. The Handbook of Exact String Matching Algorithms presents 38 methods for solving this problem. For each, it gives the main features, a description, its C code, an example and references.