Pattern matching algorithms
Gespeichert in:
| Format: | Elektronisch E-Book |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
New York
Oxford University Press
1997
|
| Schlagworte: | |
| Online-Zugang: | DE-1046 DE-1047 Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Beschreibung: | Includes bibliographical references and index Off-line serial exact string searching / M. Crochemore -- Off-line parallel exact string searching / Z. Galil and I. Yudkiewicz -- On-line string searching / A. Apostolico -- Serial computations of Levenshtein distances / D.S. Hirschberg -- Parallel computations of Levenshtein distances / A. Apostolico and M.J. Atallah -- Approximate string searching / G.M. Landau and U. Vishkin -- Dynamic programming : special cases / R. Giancarlo -- Shortest common superstrings / M. Li and T. Jiang -- Two dimensional matching / A. Amir and M. Farach -- Suffix tree data structures for matrices / R. Giancarlo and R. Grossi -- Tree pattern matching / K. Zhang and D. Shasa This text 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 from the frontier of research |
|---|---|
| Beschreibung: | 1 Online-Ressource (377 p.) |
| ISBN: | 0195113675 1280453915 1423759702 1602561915 9780195113679 9781280453915 9781423759706 9781602561915 |