Optimal parallel pattern matching von vishkin uzi (6 Ergebnisse)

PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

Paperback. Zustand: New. Print on Demand. 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. 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.…

Zustand: Hervorragend. Zustand: Hervorragend | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.