Vous l'avez déjà ? Vendez votre exemplaire ici
Désolé, cet article n'est pas disponible en
Image non disponible pour la
couleur :
Image non disponible

Dites-le à l'éditeur :
J'aimerais lire ce livre sur Kindle !

Vous n'avez pas encore de Kindle ? Achetez-le ici ou téléchargez une application de lecture gratuite.

Flexible Pattern Matching in Strings: Practical On-Line Search Algorithms for Texts and Biological Sequences [Anglais] [Relié]

Gonzalo Navarro , Mathieu Raffinot

Voir les offres de ces vendeurs.


Prix Amazon Neuf à partir de Occasion à partir de
Relié --  
Broché EUR 40,60  

Description de l'ouvrage

27 mai 2002
String matching problems range from the relatively simple task of searching a single text for a string of characters to searching a database for approximate occurrences of a complex pattern. Recent years have witnessed a dramatic increase of interest in sophisticated string matching problems, especially in information retrieval and computational biology. This book presents a practical approach to string matching problems, focusing on the algorithms and implementations that perform best in practice. It covers searching for simple, multiple and extended strings, as well as regular expressions, and exact and approximate searching. It includes all the most significant new developments in complex pattern searching. The clear explanations, step-by-step examples, algorithm pseudocode, and implementation efficiency maps will enable researchers, professionals and students in bioinformatics, computer science, and software engineering to choose the most appropriate algorithms for their applications.

Offres spéciales et liens associés

Descriptions du produit

Revue de presse

'If you need efficient pattern matching for any kind of string then this is the only book I know that comes even close to providing you [with] the tools for the job.' The Journal of the ACCU

'I really enjoyed reading and studying this book. I am convinced it is a must-read, especially chapters 4 through 6, for anyone who is involved in the task of designing algorithms for modern string or sequence matching.' Computing Reviews

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
Parcourir les pages échantillon
Couverture | Copyright | Table des matières | Extrait | Index | Quatrième de couverture
Rechercher dans ce livre:

Vendre une version numérique de ce livre dans la boutique Kindle.

Si vous êtes un éditeur ou un auteur et que vous disposez des droits numériques sur un livre, vous pouvez vendre la version numérique du livre dans notre boutique Kindle. En savoir plus

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: 4.7 étoiles sur 5  3 commentaires
16 internautes sur 16 ont trouvé ce commentaire utile 
5.0 étoiles sur 5 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.

6 internautes sur 7 ont trouvé ce commentaire utile 
4.0 étoiles sur 5 Solid Theory 4 juin 2003
Par Stephen Gould - Publié sur Amazon.com
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 
5.0 étoiles sur 5 Definitive. Period 24 septembre 2011
Par Mischa Sandberg - Publié sur Amazon.com
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

Discussions entre clients

Le forum concernant ce produit
Discussion Réponses Message le plus récent
Pas de discussions pour l'instant

Posez des questions, partagez votre opinion, gagnez en compréhension
Démarrer une nouvelle discussion
Première publication:
Aller s'identifier

Rechercher parmi les discussions des clients
Rechercher dans toutes les discussions Amazon

Rechercher des articles similaires par rubrique


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