{"product_id":"computer-algorithms-string-pattern-matching-strategies-paperback-softback-9780818654626","title":"Computer Algorithms; String Pattern Matching Strategies (Paperback \/ softback) 9780818654626","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eComputer Algorithms\u003c\/font\u003e\u003cbr\u003e\r\n\u003cfont size=\"5\"\u003eString Pattern Matching Strategies\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\r\n\u003cp\u003e\u003cfont size=\"4\"\u003eJun-ichi Aoe (Author)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9780818654626, Wiley\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003ePaperback \/ softback, published 30 May 1994\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e300 pages\u003cbr\u003e28.8 x 22.3 x 2.4 cm, 1.168 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003eIntroduces 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.\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003ePreface.\u003cbr\u003e \u003cbr\u003e CHAPTER 1: SINGLE KEYWORD MATCHING.\u003cbr\u003e \u003cbr\u003e Fast Pattern Matching in Strings (D.E. Knuth, J.H. Morris, and V.R. Pratt from SIAM Journal of Computing, June 1977).\u003cbr\u003e \u003cbr\u003e A Fast String Searching Algorithm (R.S. Boyer and J.S. Moore from Communications of the ACM, October 1977).\u003cbr\u003e \u003cbr\u003e Algorithms for Pattern Matching (G. Davies and S. Bowsher from Software -\u003cbr\u003e Practice and Experience, June 1986).\u003cbr\u003e \u003cbr\u003e CHAPTER 2: MATCHING SETS OF KEYWORDS.\u003cbr\u003e \u003cbr\u003e Efficient String Matching: An Aid to Bibliographic Search (A.V. Aho and M.J. Corasick from Communications of the ACM, June 1975).\u003cbr\u003e \u003cbr\u003e A Method for Improving String Pattern Matching Machines (J. Aoe, Y. Yamamoto, and R. Shimada from IEEE Trans. on Software Engineering, January 1984).\u003cbr\u003e \u003cbr\u003e An Efficient Algorithm for Matching Multiple Patterns (J.-J. Fan and K.-Y. Su from IEEE Trans. on Knowledge and Data Engineering, April 1993).\u003cbr\u003e \u003cbr\u003e CHAPTER 3: APPROXIMATE STRING MATCHING.\u003cbr\u003e \u003cbr\u003e Approximate String Matching (P.V. Hall and G.R. Dowling from ACM Computing Surveys, December 1980).\u003cbr\u003e \u003cbr\u003e Optimal Correspondence of String Subsequences (Y.P. Wang and T. Pavlidis from IEEE Trans. on Pattern Analysis and Machine Intelligence, Nov. 1990).\u003cbr\u003e \u003cbr\u003e The Noisy Substring Matching Problem (R.L. Kashyap and B.J. Oommen from IEEE Trans. on Software Engineering, May 1983).\u003cbr\u003e \u003cbr\u003e CHAPTER 4: MULTIDIMENSIONAL MATCHING.\u003cbr\u003e \u003cbr\u003e Pattern Matching in Trees (C.M. Hoffmann and M.J. O'Donnell from Journal of the ACM, January 1982).\u003cbr\u003e \u003cbr\u003e Code Generation Using Tree Matching and Dynamic Programming (A.V. Aho, M. Ganapathi, and S.W.K. Tjiang from ACM Trans. on Programming Languages and Systems, Oct. 1989).\u003cbr\u003e \u003cbr\u003e The Tree-to-Tree Correction Problem (K.-C. Tai from Journal of the ACM, July 1979).\u003cbr\u003e \u003cbr\u003e A Technique for Two-Dimensional Pattern Matching (R.F. Zhu and T. Takaoka from Communications of the ACM, September 1989).\u003cbr\u003e \u003cbr\u003e CHAPTER 5: HARDWARE MATCHING.\u003cbr\u003e \u003cbr\u003e Performance and Architectural Issues for String Matching (M.E. Isenman and D.E. Shasha from IEEE Trans. on Computers, February 1990).\u003cbr\u003e \u003cbr\u003e HYTREM -\u003cbr\u003e A Hybrid Text-Retrieval Machine for Large Databases (D.L. Lee and F.H. Lochovsky from IEEE Trans. on Computers, January 1990).\u003cbr\u003e \u003cbr\u003e REFERENCES.\u003cbr\u003e \u003cbr\u003e ABOUT THE AUTHOR.\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Mathematics [\u003ca title=\"See our other books on Mathematics\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Mathematics%20%5BPB%5D%22\"\u003ePB\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"Wiley-IEEE Computer Society Pr","offers":[{"title":"Brand New","offer_id":52410714456344,"sku":"9780818654626","price":58.69,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/files\/9780818654626.jpg?v=1784249823","url":"https:\/\/freshlyprintedbooks.co.uk\/products\/computer-algorithms-string-pattern-matching-strategies-paperback-softback-9780818654626","provider":"Freshly Printed Books","version":"1.0","type":"link"}