About this product

Product Identifiers

PublisherOxford University Press, Incorporated

ISBN-100195113675

ISBN-139780195113679

eBay Product ID (ePID)255091

Product Key Features

Number of Pages400 Pages

Publication NamePattern Matching Algorithms

LanguageEnglish

Publication Year1997

SubjectComputer Science

TypeTextbook

Subject AreaComputers

AuthorZvi Galil

FormatHardcover

Dimensions

Item Height0.9 in

Item Weight26.8 Oz

Item Length9.6 in

Item Width6.5 in

Additional Product Features

Intended AudienceCollege Audience

LCCN96-049602

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 stateof 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 graduatestudents."--Choice, "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 thepractical importance and the awesome power of pattern matching algorithms, whichfind a specific search string within a text file. Here, 11 chapters, whichrepresent the combined work of 16 contributors, survey the state of the art. Thefocus of the chapters varies depending on whether authors treat serial orparallel 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, "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, "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 andproblems 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 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 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, "The book is written by the best experts in the area and is an excellenttext for specialists working in algorithmics on texts, which is a broad subareaof theoretical computer science not sufficiently covered in the literature. Thebook is a very welcome handbook covering basic algorithms and problems relatedto string/array/tree pattern-matching and should be highlyrecommended."--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

Dewey Edition21

IllustratedYes

Dewey Decimal006.4

Table Of Content1. Off-Line Serial Exact String Searching2. Off-Line Parallel Exact String Searching3. On-Line String Searching4. Serial Computations of Levenshtein Distances5. Parallel Computations of Levenshtein Distances6. Approximate String Searching7. Dynamic Programming: Special Cases8. Shortest Common Superstrings9. Two Dimensional Matching10. Suffix Tree Data Structures for Matrices11. Tree Pattern Matching

SynopsisIssues 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 devotedyears 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, thisis the right time for a book that brings together information relevant to both graduate students and specialists in need of an in-depth reference., 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., This book attempts an overview of the current state of the art in 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 portray faithfully the current frontier of research in the field. An in-depth reference for specialists in the field, the book can be used in an advanced graduate course.

LC Classification NumberQA76.9.A43P38 1997