Pattern Matching Algorithms

by Alberto Apostolico (Editor), Zvi Galil (Editor)

Overview

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.

Product Details

ISBN-13:	9780195113679
Publisher:	Oxford University Press
Publication date:	05/29/1997
Pages:	400
Product dimensions:	9.21(w) x 6.14(h) x 0.88(d)

About the Author

Universita di Padova

Columbia University

Table of Contents

1. Off-Line Serial Exact String Searching, M. Crochemore2. Off-Line Parallel Exact String Searching, Z. Galil and I. Yudkiewicz3. On-Line String Searching, A. Apostolico4. Serial Computations of Levenshtein Distances, D.S. Hirschberg5. Parallel Computations of Levenshtein Distances, A. Apostolico and M.J. Atallah6. Approximate String Searching, G.M. Landau and U. Vishkin7. Dynamic Programming: Special Cases, R. Giancarlo8. Shortest Common Superstrings, M. Li and T. Jiang9. Two Dimensional Matching, A. Amir and M. Farach10. Suffix Tree Data Structures for Matrices, R. Giancarlo and R. Grossi11. Tree Pattern Matching, K. Zhang and D. Shasha

Editorial Reviews

"Anyone who has ever used an Internet search engine appreciates both the practical importance and the awesome power of pattern matching algorithms, which find a specific search string within a text file. Here, 11 chapters, which represent the combined work of 16 contributors, survey the state of the art. The focus of the chapters varies depending on whether authors treat serial or parallel algorithms, online searching or offline preprocessing (of either the search string or the text file), approximate matching or exact matching. . . . For upper-division undergraduate and graduate students."—Choice

"The book is written by the best experts in the area and is an excellent text for specialists working in algorithmics on texts, which is a broad subarea of theoretical computer science not sufficiently covered in the literature. The book is a very welcome handbook covering basic algorithms and problems related to string/array/tree pattern-matching and should be highly recommended."—Mathematical Reviews

From the Publisher