Flexible pattern matching in strings

Practical on-line search algorithms for texts and biological sequences

222 pages, parution le 16/05/2002

Ajouter à une liste

Indisponible

Résumé

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, exactly and approximately. It includes all of 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.

Contents

Introduction
String matching
Multiple string matching
Extend string matching
Regular expression matching
Approximate matching
Conclusion
Bibliography
Index

Caractéristiques techniques

	PAPIER
Éditeur(s)	Cambridge University Press
Parution	16/05/2002
Nb. de pages	222
Format	18 x 25,5
Couverture	Relié
Poids	553g
Intérieur	Noir et Blanc
EAN13	9780521813075
ISBN13	978-0-521-81307-5