Synopsis
Efficient parallel and serial approximate string matching explores how to find pattern occurrences in text when up to k differences are allowed.
It presents new algorithms that work in parallel and in series to handle the k-differences problem efficiently.
The book explains the problem setup, introduces a three-part approach, and shows how a powerful characterization of the text can lead to fast solutions. It discusses computational models like RAM and PRAM, and compares new methods to classical exact matching algorithms, highlighting where parallelism helps and where it does not.- How to model and measure differences between a pattern and text, including mismatches, deletions, and insertions.
- How to build a compact description of the text that supports fast final search for all valid occurrences.
- How the serial and parallel algorithms are structured: pattern analysis, text analysis, and locating all matches with at most k differences.
- What the workload looks like on parallel hardware, including processor counts and time bounds for each stage.
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Efficient Parallel and Serial Approximate String Matching...
Seller Image
Efficient Parallel and Serial Approximate String Matching (Classic Reprint)
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 4 out of 5 stars
Paperback. Condition: New. Print on Demand. This book presents two algorithms for the string matching problem with mismatches, where differences between characters are allowed. The first is a parallel algorithm that has three main parts: pattern analysis, text analysis, and finding occurrences of the pattern in the text. The second is a serial algorithm that uses a new approach to text handling. Prior to this book, no algorithm was able to cope with mismatches in the string matching problem. The new serial algorithm is considerably easier to implement, running in O(kn) time for fixed-size alphabets and O(knlogm) for general input, where k is the number of mismatches and n, m are the lengths of input text and pattern respectively. The parallel algorithm takes O(logm) time using m^2 processors for the first two parts, and O(k) time using n processors for the third part. Both algorithms have a space requirement of O(n). The book's insights offer a significant leap from previous algorithms that were not able to handle mismatches, opening new possibilities for practical applications like analyzing unreliable data in real-time scenarios. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Seller Inventory # 9781333041229_0
Buy New
US$ 17.15
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Efficient Parallel and Serial Approximate String Matching Classic Reprint
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781333041229
Stock Image
Efficient Parallel and Serial Approximate String Matching Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 4 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781333041229
Buy New
US$ 24.00
US$ 4.48 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 15 available