Flexible pattern matching in strings practical on-line search algorithms for texts and biological sequences Gonzalo Navarro, Mathieu Raffinot.

Navarro, Gonzalo:

ISBN 10: 0521813077 / ISBN 13: 9780521813075

Published by Cambridge, Cambridge University Press, 2002

About this Item

Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 92 NAV 9780521813075 Sprache: Englisch Gewicht in Gramm: 550.

Seller Inventory # 2499872

Bibliographic Details

• Title: Flexible pattern matching in strings practical on-line search algorithms for texts and biological sequences Gonzalo Navarro, Mathieu Raffinot.
• Publisher: Cambridge, Cambridge University Press
• Publication Date: 2002
• Language: English
• ISBN 10: 0521813077
• ISBN 13: 9780521813075
• Binding: Hardcover
• Seller catalogs:
  • SA MATHEMATIK

About this title

Synopsis

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.

Book Description

Recent years have witnessed a dramatic increase of interest in sophisticated string matching problems, mainly arising from information retrieval and computational biology. In this book, the authors present several new string matching algorithms, developed to handle these complex new problems. Unlike most other books, the emphasis is those techniques that work best in practice, which are also the simplest ones in general. 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.