+612 9045 4394
 
CHECKOUT
Pattern Matching Algorithms - Alberto Apostolico

Pattern Matching Algorithms

By: Alberto Apostolico (Editor), Zvi Galil (Editor)

Hardcover Published: 1st May 1997
ISBN: 9780195113679
Number Of Pages: 400

Share This Book:

Hardcover

RRP $510.95
$413.25
19%
OFF
or 4 easy payments of $103.31 with Learn more
This title is not in stock at the Booktopia Warehouse and needs to be ordered from our supplier.
Click here to read more about delivery expectations.

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.

"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 "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

1: M. Crochemore: Off-Line Serial Exact String Searching 2: Z. Galil and I. Yudkiewicz: Off-Line Parallel Exact String Searching 3: A. Apostolico: On-Line String Searching 4: D.S. Hirschberg: Serial Computations of Levenshtein Distances 5: A. Apostolico and M.J. Atallah: Parallel Computations of Levenshtein Distances 6: G.M. Landau and U. Vishkin: Approximate String Searching 7: R. Giancarlo: Dynamic Programming: Special Cases 8: M. Li and T. Jiang: Shortest Common Superstrings 9: A. Amir and M. Farach: Two Dimensional Matching 10: R. Giancarlo and R. Grossi: Suffix Tree Data Structures for Matrices 11: K. Zhang and D. Shasha: Tree Pattern Matching

ISBN: 9780195113679
ISBN-10: 0195113675
Audience: Tertiary; University or College
Format: Hardcover
Language: English
Number Of Pages: 400
Published: 1st May 1997
Country of Publication: US
Dimensions (cm): 24.77 x 16.51  x 2.54
Weight (kg): 0.76