Flexible Pattern Matching in Strings (Paperback)

Gonzalo Navarro

ISBN 10: 0521039932 / ISBN 13: 9780521039932

Published by Cambridge University Press, Cambridge, 2007

About this Item

Paperback. 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. Presents recently developed algorithms for searching for simple, multiple and extended strings, regular expressions, exact and approximate matches. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Seller Inventory # 9780521039932

Bibliographic Details

• Title: Flexible Pattern Matching in Strings (Paperback)
• Publisher: Cambridge University Press, Cambridge
• Publication Date: 2007
• Language: English
• ISBN 10: 0521039932
• ISBN 13: 9780521039932
• Binding: Paperback
• Edition: 1st Edition
• Condition: new

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.