Computer Algorithms: String Pattern Matching Strategies

Computer Algorithms: String Pattern Matching Strategies

ISBN: 9780818654626
Publisher: Wiley-IEEE Computer Society Pr
Edition: 1
Publication Date: 1994-05-30
Number of pages: 296
  • $38.27

Any used item that originally included an accessory such as an access code, one time use worksheet, cd or dvd, or other one time use accessories may not be guaranteed to be included or valid. By purchasing this item you acknowledge the above statement.


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.

Customer Reviews

We Also Recommend