Pattern Matching Algorithms
Published on 31. July 1997
Book
Hardback
400 pages
978-0-19-511367-9 (ISBN)
Description
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.
Reviews / Votes
"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 thesearch 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
"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
More details
Language
English
Place of publication
New York
United States
Target group
Professional and scholarly
Illustrations
line figures
Dimensions
Height: 240 mm
Width: 161 mm
Thickness: 26 mm
Weight
757 gr
ISBN-13
978-0-19-511367-9 (9780195113679)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
Alberto Apostolico | Zvi Galil
Pattern Matching Algorithms
E-Book
05/1997
1st Edition
OUP eBook
€162.99
Available for download
Persons
Editor
Computer Science Department, Purdue University, USA, and Dipartimento di Electronica e InformaticaComputer Science Department, Purdue University, USA, and Dipartimento di Electronica e Informatica, Universita di Padova, Italy
Department of Computer ScienceDepartment of Computer Science, Columbia University, USA
Content
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