
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
Author description coming soon. We're reaching out to them in the ether...
This book investigates the fundamental problem of efficiently finding occurrences of a pattern within a larger text. It delves into the theoretical underpinnings and practical algorithms for string matching, exploring various models of computation and their impact on pattern matching capabilities. The work examines the trade-offs between preprocessing time, matching time, and space complexity, providing a comprehensive overview of the field.
The book is recognized as a thorough and authoritative treatment of string matching algorithms. Its depth and breadth make it a valuable resource for researchers and graduate students in computer science. The rigorous mathematical analysis and comprehensive coverage of various algorithms are frequently cited as strengths.
Page Count:
232
Publication Date:
2002-01-01
ISBN-10:
0521813077
ISBN-13:
9780521813075
No comments yet. Be the first to share your thoughts!