Pattern Matching Algorithms

Front Cover
Alberto Apostolico, Zvi Galil
Oxford University Press, May 29, 1997 - Computers - 400 pages
0 Reviews
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.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

1 Offline Serial Exact String Searching
1
2 Offline Parallel Exact String Searching
55
3 Online String Searching
89
4 Serial Computations of Levenshtein Distances
123
5 Parallel Computations of Levenshtein Distances
143
6 Approximate String Searching
185
Special Cases
201
8 Shortest Common Superstrings
237
9 Two Dimensional Matching
267
10 Suffix Tree Data Structures for Matrices
293
11 Tree Pattern Matching
341
Index
373
Copyright

Other editions - View all

Common terms and phrases

References to this book

All Book Search results »

Bibliographic information