Pattern Matching Algorithms (inbunden)
Fler böcker inom
Format
Inbunden (Hardback)
Språk
Engelska
Antal sidor
392
Utgivningsdatum
1997-07-01
Förlag
OUP USA
Medarbetare
Galil, Zvi
Illustrationer
figs.
Dimensioner
234 x 156 x 22 mm
Vikt
731 g
Antal komponenter
1
Komponenter
377 p. :
ISBN
9780195113679

Pattern Matching Algorithms

av Alberto Apostolico
Inbunden,  Engelska, 1997-07-01
2670
Köp
Spara som favorit
  • Skickas från oss inom 7-10 vardagar.
  • Fri frakt över 249 kr för privatkunder i Sverige.
Finns även som
Visa alla 1 format & utgåvor
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.
Visa hela texten

Passar bra ihop

  1. Pattern Matching Algorithms
  2. +
  3. The Anxious Generation

De som köpt den här boken har ofta också köpt The Anxious Generation av Jonathan Haidt (inbunden).

Köp båda 2 för 2959 kr

Kundrecensioner

Har du läst boken? Sätt ditt betyg »

Fler böcker av Alberto Apostolico

Recensioner i media

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

Innehållsförteckning

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

Du kanske gillar