959:-
Uppskattad leveranstid 7-11 arbetsdagar
Fri frakt för medlemmar vid köp för minst 249:-
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.
- Format: Pocket/Paperback
- ISBN: 9780521039932
- Språk: Engelska
- Antal sidor: 232
- Utgivningsdatum: 2007-07-01
- Förlag: Cambridge University Press