Pattern Matching Algorithms - Rilegato

Rilegato

ISBN 10: 0195113675 ISBN 13: 9780195113679

Casa editrice: OUP USA, 1997

Riassunto

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.

Su questo libro

Contenuti

• 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

Dettagli dell'edizione

• Editore: OUP USA
• Data di pubblicazione: 1997
• Lingua: Inglese
• ISBN 10: 0195113675
• ISBN 13: 9780195113679
• Rilegatura: Copertina rigida
• Numero di pagine: 400
• Redattore: Apostolico Alberto, Galil Zvi
• Contatto del produttore: Messaggerie Libri; ufficio.anagrafiche@meli.it; ; Via Verdi, 8.; Assago Milano; 20090; Italia