Pattern matching algorithms
著者
書誌事項
Pattern matching algorithms
Oxford University Press, 1997
大学図書館所蔵 件 / 全26件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references and index
内容説明・目次
内容説明
Issues of matching and searching on elementary discrete structures arise pervasively in computer science and many of its applications, and their relevance is expected to grow as information is amassed and shared at an accelerating pace. Several algorithms were discovered as a result of these needs, which in turn created the subfield of Pattern Matching. This book provides an overview of the current state of Pattern Matching as seen by specialists who have devoted
years of study to the field. It covers most of the basic principles and presents material advanced enough to faithfully portray the current frontier of research. Because of these recent advances, this is the right time for a book that brings together information relevant to both graduate students and
specialists in need of an in-depth reference.
目次
- 1. Off-Line Serial Exact String Searching
- 2. Off-Line Parallel Exact String Searching
- 3. On-Line String Searching
- 4. Serial Computations of Levenshtein Distances
- 5. Parallel Computations of Levenshtein Distances
- 6. Approximate String Searching
- 7. Dynamic Programming: Special Cases
- 8. Shortest Common Superstrings
- 9. Two Dimensional Matching
- 10. Suffix Tree Data Structures for Matrices
- 11. Tree Pattern Matching
「Nielsen BookData」 より