Cantitate/Preț
Produs

Flexible Pattern Matching in Strings: Practical On-Line Search Algorithms for Texts and Biological Sequences

Autor Gonzalo Navarro, Mathieu Raffinot
en Limba Engleză Paperback – 25 iul 2007
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.
Citește tot Restrânge

Preț: 38620 lei

Preț vechi: 48275 lei
-20% Nou

Puncte Express: 579

Preț estimativ în valută:
7392 7683$ 6123£

Carte tipărită la comandă

Livrare economică 04-18 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780521039932
ISBN-10: 0521039932
Pagini: 232
Ilustrații: 90 b/w illus.
Dimensiuni: 169 x 245 x 10 mm
Greutate: 0.38 kg
Editura: Cambridge University Press
Colecția Cambridge University Press
Locul publicării:New York, United States

Cuprins

1. Introduction; 2. String matching; 3. Multiple string matching; 4. Extended string matching; 5. Regular expression matching; 6. Approximate matching; 7. Conclusion; Bibliography; Index.

Recenzii

'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

Descriere

Presents recently developed algorithms for searching for simple, multiple and extended strings, regular expressions, exact and approximate matches.