Computer Algorithms: String Pattern Matching Strategies
June 1994, Wiley-IEEE Computer Society Press
This is a Print-on-Demand title. It will be printed specifically to fill your order. Please allow an additional 2-3 days delivery time. The book is not returnable.
Introduces the basic concepts and characteristics of string pattern matching strategies and provides numerous references for further reading. The text describes and evaluates the BF, KMP, BM, and KR algorithms, discusses improvements for string pattern matching machines, and details a technique for detecting and removing the redundant operation of the AC machine. Also explored are typical problems in approximate string matching. In addition, the reader will find a description for applying string pattern matching algorithms to multidimensional matching problems, an investigation of numerous hardware-based solutions for pattern matching, and an examination of hardware approaches for full text search.