Computer Algorithms String Pattern Matching Strategies [Paperback]

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.Preface.

CHAPTER 1: SINGLE KEYWORD MATCHING.

Fast Pattern Matching in Strings (D.E. Knuth, J.H. Morris, and V.R. Pratt from SIAM Journal of Computing, June 1977).

A Fast String Searching Algorithm (R.S. Boyer and J.S. Moore from Communications of the ACM, October 1977).

Algorithms for Pattern Matching (G. Davies and S. Bowsher from Software -
Practice and Experience, June 1986).

CHAPTER 2: MATCHING SETS OF KEYWORDS.

Efficient String Matching: An Aid to Bibliographic Search (A.V. Aho and M.J. Corasick from Communications of the ACM, June 1975).

A Method for Improving String Pattern Matching Machines (J. Aoe, Y. Yamamoto, and R. Shimada from IEEE Trans. on Software Engineering, January 1984).

An Efficient Algorithm for Matching Multiple Patterns (J.-J. Fan and K.-Y. Su from IEEE Trans. on Knowledge and Data Engineering, April 1993).

CHAPTER 3: APPROXIMATE STRING MATCHING.

Approximate String Matching (P.V. Hall and G.R. Dowling from ACM Computing Surveys, December 1980).

Optimal Correspondence l£0