Name: Pattern Matching Algorithms By Alberto Apostolico (Computer Science Department, Purdue University, USA, and Dipartimento di Electronica e Informatica, Computer Science Department, Purdue University, USA, and Dipartimento di Electronica e Informatica, Universita di Padova)
SKU: 9780195113679
Price: 250.69 USD
Availability: InStock

Pattern Matching Algorithms Summary

Pattern Matching Algorithms by Alberto Apostolico (Computer Science Department, Purdue University, USA, and Dipartimento di Electronica e Informatica, Computer Science Department, Purdue University, USA, and Dipartimento di Electronica e Informatica, Universita di Padova)

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.

Pattern Matching Algorithms 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 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. 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

Additional information

Sku

NPB9780195113679

ISBN 13

9780195113679

ISBN 10

0195113675

Title

Pattern Matching Algorithms by Alberto Apostolico (Computer Science Department, Purdue University, USA, and Dipartimento di Electronica e Informatica, Computer Science Department, Purdue University, USA, and Dipartimento di Electronica e Informatica, Universita di Padova)

Author

Alberto Apostolico (Computer Science Department, Purdue University, USA, and Dipartimento di Electronica e Informatica, Computer Science Department, Purdue University, USA, and Dipartimento di Electronica e Informatica, Universita di Padova)

Condition

New

Binding type

Hardback

Publisher

Oxford University Press Inc

Year published

1997-07-31

Number of pages

392

Prizes

N/A

Cover note

Book picture is for illustrative purposes only, actual binding, cover or edition may vary.

Note

This is a new book - be the first to read this copy. With untouched pages and a perfect binding, your brand new copy is ready to be opened for the first time

Pattern Matching Algorithms Alberto Apostolico (Computer Science Department, Purdue University, USA, and Dipartimento di Electronica e Informatica, Computer Science Department, Purdue University, USA, and Dipartimento di Electronica e Informatica, Universita di Padova)

Pattern Matching Algorithms by Alberto Apostolico (Computer Science Department, Purdue University, USA, and Dipartimento di Electronica e Informatica, Computer Science Department, Purdue University, USA, and Dipartimento di Electronica e Informatica, Universita di Padova)

Summary

Pattern Matching Algorithms Summary

Pattern Matching Algorithms by Alberto Apostolico (Computer Science Department, Purdue University, USA, and Dipartimento di Electronica e Informatica, Computer Science Department, Purdue University, USA, and Dipartimento di Electronica e Informatica, Universita di Padova)

Pattern Matching Algorithms Reviews

Table of Contents

Additional information

Customer Reviews - Pattern Matching Algorithms