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.
Price: 57.77 USD
Location: Hillsdale, NSW
End Time: 2025-01-02T11:26:55.000Z
Shipping Cost: 0 USD
Product Images
Item Specifics
Return shipping will be paid by: Buyer
All returns accepted: Returns Accepted
Item must be returned within: 60 Days
Refund will be given as: Money back or replacement (buyer's choice)
Return policy details:
EAN: 9780521039932
UPC: 9780521039932
ISBN: 9780521039932
MPN: N/A
Number of Pages: 232 Pages
Language: English
Publication Name: Flexible Pattern Matching in Strings : Practical on-Line Search Algorithms for Texts and Biological Sequences
Publisher: Cambridge University Press
Publication Year: 2007
Subject: Programming / Algorithms, General, Databases / General
Item Height: 0.4 in
Type: Textbook
Item Weight: 13 Oz
Author: Mathieu Raffinot, Gonzalo Navarro
Item Length: 9.6 in
Subject Area: Computers
Item Width: 6.7 in
Format: Trade Paperback
