Pattern matching algorithms

edited by Alberto Apostolico, Zvi Galil

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.

「Nielsen BookData」より

[目次]

  • 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」より

この本の情報

書名 Pattern matching algorithms
著作者等 Apostolico, Alberto
Galil, Zvi
Galil Z.
出版元 Oxford University Press
刊行年月 1997
ページ数 377 p.
大きさ 25 cm
ISBN 0195113675
NCID BA31123406
※クリックでCiNii Booksを表示
言語 英語
出版国 アメリカ合衆国
この本を: 
このエントリーをはてなブックマークに追加

このページを印刷

外部サイトで検索

この本と繋がる本を検索

ウィキペディアから連想