Optimal Parallel Pattern Matching in Strings (Classic Reprint)

Uzi Vishkin

ISBN 10: 1528511964 / ISBN 13: 9781528511964

Published by Forgotten Books, 2017

About this Item

Zustand: Hervorragend | Sprache: Englisch | Produktart: Bücher.

Seller Inventory # 30282180/1

Bibliographic Details

• Title: Optimal Parallel Pattern Matching in Strings (Classic Reprint)
• Publisher: Forgotten Books
• Publication Date: 2017
• Language: English
• ISBN 10: 1528511964
• ISBN 13: 9781528511964
• Binding: Soft cover
• Condition: Hervorragend

About this title

Synopsis

This book presents a new approach to parallel pattern matching in strings. The author presents a linear-time algorithm for finding all occurrences of a pattern in a text. The algorithm runs in O(n/p) time using any number of p ≤ n/log n processors on a concurrent-read concurrent-write parallel random-access machine. This algorithm is optimal in the sense that it achieves the best possible running time for this problem on this type of parallel machine. The author also discusses the importance of this problem and its applications in various fields such as text processing, computational biology, and data mining. Overall, this book provides a comprehensive and in-depth analysis of parallel pattern matching in strings, making it a valuable resource for researchers and practitioners in the field.