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. The first chapter's survey paper describes the basic concepts of algorithm classifications. The five chapters that follow include 15 papers further illustrating these classifications: Single keyword matching Matching sets of keywords Approximate string matching Multidimensional matching Hardware matching... Sellers, P.H., Identifying periodic occurrences of a template with applications to protein structure, Third Symp. Combinatorial ... 1087-1099 (1973). [Futatsugi et ... [Gen-Huey, 92] Gen-Huey, C., An O(l) time algorithm for string matching, Int. I. Comput. Math, 42 ... P., Simple word problems in universal algebras, in Leech, 1., ed., Computational Problems in Abstract Algebra, Pergammon Press, Oxford, pp.
|Publisher||:||John Wiley & Sons - 1994-06-13|