滿額折
Computer Algorithms: String Pattern Matching Strategies
商品資訊
ISBN13：9780818654626
出版社：John Wiley & Sons Inc
作者：Aoe
出版日：1994/05/30
裝訂／頁數：平裝／300頁
規格：28.6cm*22.2cm*3.2cm (高/寬/厚)
定價
：NT$ 5098 元優惠價
：
90 折 4588 元
若需訂購本書，請電洽客服 02-25006600[分機130、131]。
商品簡介
目次
商品簡介
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 of String Subsequences (Y.P. Wang and T. Pavlidis from IEEE Trans. on Pattern Analysis and Machine Intelligence, Nov. 1990).
The Noisy Substring Matching Problem (R.L. Kashyap and B.J. Oommen from IEEE Trans. on Software Engineering, May 1983).
CHAPTER 4: MULTIDIMENSIONAL MATCHING.
Pattern Matching in Trees (C.M. Hoffmann and M.J. O'Donnell from Journal of the ACM, January 1982).
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).
The Tree-to-Tree Correction Problem (K.-C. Tai from Journal of the ACM, July 1979).
A Technique for Two-Dimensional Pattern Matching (R.F. Zhu and T. Takaoka from Communications of the ACM, September 1989).
CHAPTER 5: HARDWARE MATCHING.
Performance and Architectural Issues for String Matching (M.E. Isenman and D.E. Shasha from IEEE Trans. on Computers, February 1990).
HYTREM -
A Hybrid Text-Retrieval Machine for Large Databases (D.L. Lee and F.H. Lochovsky from IEEE Trans. on Computers, January 1990).
REFERENCES.
ABOUT THE AUTHOR.
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 of String Subsequences (Y.P. Wang and T. Pavlidis from IEEE Trans. on Pattern Analysis and Machine Intelligence, Nov. 1990).
The Noisy Substring Matching Problem (R.L. Kashyap and B.J. Oommen from IEEE Trans. on Software Engineering, May 1983).
CHAPTER 4: MULTIDIMENSIONAL MATCHING.
Pattern Matching in Trees (C.M. Hoffmann and M.J. O'Donnell from Journal of the ACM, January 1982).
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).
The Tree-to-Tree Correction Problem (K.-C. Tai from Journal of the ACM, July 1979).
A Technique for Two-Dimensional Pattern Matching (R.F. Zhu and T. Takaoka from Communications of the ACM, September 1989).
CHAPTER 5: HARDWARE MATCHING.
Performance and Architectural Issues for String Matching (M.E. Isenman and D.E. Shasha from IEEE Trans. on Computers, February 1990).
HYTREM -
A Hybrid Text-Retrieval Machine for Large Databases (D.L. Lee and F.H. Lochovsky from IEEE Trans. on Computers, January 1990).
REFERENCES.
ABOUT THE AUTHOR.
購物須知
外文書商品之書封，為出版社提供之樣本。實際出貨商品，以出版社所提供之現有版本為主。部份書籍，因出版社供應狀況特殊，匯率將依實際狀況做調整。
無庫存之商品，在您完成訂單程序之後，將以空運的方式為你下單調貨。為了縮短等待的時間，建議您將外文書與其他商品分開下單，以獲得最快的取貨速度，平均調貨時間為1~2個月。
為了保護您的權益，「三民網路書店」提供會員七日商品鑑賞期(收到商品為起始日)。
若要辦理退貨，請在商品鑑賞期內寄回，且商品必須是全新狀態與完整包裝(商品、附件、發票、隨貨贈品等)否則恕不接受退貨。