Vous l'avez déjà ?
Repliez vers l'arrière Repliez vers l'avant
Ecoutez Lecture en cours... Interrompu   Vous écoutez un extrait de l'édition audio Audible
En savoir plus

Flexible Pattern Matching in Strings: Practical On-Line Search Algorithms for Texts and Biological Sequences (Anglais) Relié – 27 mai 2002


Voir les 2 formats et éditions Masquer les autres formats et éditions
Prix Amazon Neuf à partir de Occasion à partir de
Relié
"Veuillez réessayer"
EUR 206,01 EUR 86,52

Offres spéciales et liens associés


NO_CONTENT_IN_FEATURE

Détails sur le produit


En savoir plus sur l'auteur

Découvrez des livres, informez-vous sur les écrivains, lisez des blogs d'auteurs et bien plus encore.

Dans ce livre (En savoir plus)
Première phrase
String matching can be understood as the problem of finding a pattern with some property within a given sequence of symbols. Lire la première page
En découvrir plus
Concordance
Parcourir les pages échantillon
Couverture | Copyright | Table des matières | Extrait | Index | Quatrième de couverture
Rechercher dans ce livre:

Commentaires en ligne 

Il n'y a pas encore de commentaires clients sur Amazon.fr
5 étoiles
4 étoiles
3 étoiles
2 étoiles
1 étoiles

Commentaires client les plus utiles sur Amazon.com (beta)

Amazon.com: 3 commentaires
16 internautes sur 16 ont trouvé ce commentaire utile 
Thin but useful 30 octobre 2004
Par wiredweird - Publié sur Amazon.com
Format: Relié Achat vérifié
Don't let its small size (~200 pages) fool you. There's a lot of good material here, and in very usable form. In fact, that's the whole focus of the book: practical, efficient implementations.

The main topics, chapter by chapter, are simple matching of one desired word to a string, matching of multiple words, two levels of complexity in wildcards and regular expressions, and approximate matching. A number of important and historical algorithms are discussed in each chapter, in great detail. There's pseudo-code for the most important algorithms. Quite a few also have examples worked in detail. The mechanics are tedious and somewhat bulky, but anyone actually trying to implement these techniques will appreciate the examples.

What's really interesting is what's not in this book. You won't find a lot of theory, and you won't find some of the most famous algorithms in string matching. The authors make it clear that this is about practical algorithms with efficient implementations. Lots of the algorithms beloved by theoreticians are impractically complex or just plain slow. Those may be mentioned in passing or as the base for more practical algorithms, but are not welcome on these pages.

It's not an easy read, but it's not a book for people with easy problems. It discusses tradeoffs, like when one technique works well for short strings but another works better on long strings. It addresses the different needs of English-language processing and bioinformatics - just the different numbers of letters in each alphabet make a difference, in some cases.

This is a good one for anyone who takes string processing seriously. There's no cut&paste code here, but plenty for a knowledgable programmer to use. Even better, it offers references to the literature and to working code, and pointers to some books on related topics. I expect to get a lot of use out of this one.

//wiredweird
6 internautes sur 7 ont trouvé ce commentaire utile 
Solid Theory 4 juin 2003
Par Stephen Gould - Publié sur Amazon.com
Format: Relié
This is an excellent book for someone with a strong foundation in computer science wanting to learn about regular expression and string matching. It is not for the feint-hearted, and would not be recommended to computer science novices. Written by one of the world experts in the field, the relatively thin book is packed with theory and comments on application. The algorithms are presented in a very concise form which often requires a fair amount of thought when trying to implement. However once understood, the book makes an excellent reference for the various algorithms.
1 internautes sur 1 ont trouvé ce commentaire utile 
Definitive. Period 24 septembre 2011
Par Mischa Sandberg - Publié sur Amazon.com
Format: Broché
There was Knuth. And now there's Navarro. Every abstract string searching algorithm you'd care to understand, and implement, is carefully explained and analyzed, across domains ranging from DNA sequencing (the ACGT alphabet) through real-world text searching. From simple algorithms like Horspool, to complex FSA algoriths like Backward-DAWG, this book covers it all. I would be surprised if this book doesn't motivate you to work out a better string search, in your own field and context.
Ces commentaires ont-ils été utiles ? Dites-le-nous


Commentaires

Souhaitez-vous compléter ou améliorer les informations sur ce produit ? Ou faire modifier les images?