Preview "Flexible Pattern Matching in Strings" in a new window.

Flexible Pattern Matching in Strings

Book Description

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.


In The Press


About the Author


Read on Your Favourite Devices

to find out more



Ebook Permissions

to find out more

About this Ebook

File formats
This ebook is available in:
The publisher has not yet supplied format information.
Pre-order formats shown are based on publisher intent and may change before release.
File sizes shown are an approximation. The actual download size will vary based on the application you use to read the book.
Publisher
Published
; Copyright:
ISBNs
Title
Series
Author
;
Edition
Imprint
Language
Number of Pages
Page count shown is an approximation provided by the publisher. The actual page count will vary based on various factors such as your device's screen size and font-size.