What do you think?
Rate this book
Optimal Parallel Pattern Matching in Strings
Unlock faster string matching with a new approach to parallel processing
This book presents a clear, accessible look at how parallel computation can speed up pattern matching in strings. It explains models of concurrent writing and how these ideas translate into practical, scalable algorithms. Readers will see how a linear-time serial algorithm can fit into parallel frameworks to improve performance on large text data.
Learn how different parallel models affect algorithm design and performanceSee step-by-step how strings and patterns are analyzed to find matches efficientlyUnderstand the trade-offs between time and processor usage in parallel string matchingExplore the theoretical foundations behind optimal patterns and data structures Ideal for readers with an interest in algorithms, parallel computing, and efficient text processing who want a rigorous, approachable treatment of the topic.
This book presents a clear, accessible look at how parallel computation can speed up pattern matching in strings. It explains models of concurrent writing and how these ideas translate into practical, scalable algorithms. Readers will see how a linear-time serial algorithm can fit into parallel frameworks to improve performance on large text data.
Learn how different parallel models affect algorithm design and performanceSee step-by-step how strings and patterns are analyzed to find matches efficientlyUnderstand the trade-offs between time and processor usage in parallel string matchingExplore the theoretical foundations behind optimal patterns and data structures Ideal for readers with an interest in algorithms, parallel computing, and efficient text processing who want a rigorous, approachable treatment of the topic.
59 pages, Hardcover
Published August 24, 2018
Ratings & Reviews
Friends & Following
Create a free account to discover what your friends think of this book!
Community Reviews
No one has reviewed this book yet.