Pattern Matching Algorithms

Pattern Matching Algorithms

3.66 (3 ratings by Goodreads)
Edited by  , Edited by 

Free delivery worldwide

Available. Dispatched from the UK in 4 business days
When will my order arrive?


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 more

Product details

  • Hardback | 392 pages
  • 161.8 x 243.1 x 24.1mm | 730.3g
  • Oxford University Press Inc
  • New York, United States
  • English
  • New.
  • line figures
  • 0195113675
  • 9780195113679

Review quote

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

Table of contents

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 Matchingshow more

Rating details

3 ratings
3.66 out of 5 stars
5 0% (0)
4 67% (2)
3 33% (1)
2 0% (0)
1 0% (0)
Book ratings by Goodreads
Goodreads is the world's largest site for readers with over 50 million reviews. We're featuring millions of their reader ratings on our book pages to help you find your new favourite book. Close X