default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPattern Matching Algorithms 1997
- Alberto Apostolico, Zvi Galil:
Pattern Matching Algorithms. Oxford University Press 1997, ISBN 978-019-511367-9 - Maxime Crochemore:
Off-line serial exact string searching. Pattern Matching Algorithms 1997: 1-53 - Zvi Galil, I. Yudkiewicz:
Off-line parallel exact string searching. Pattern Matching Algorithms 1997: 55-88 - Alberto Apostolico:
On-line string searching. Pattern Matching Algorithms 1997: 89-122 - Daniel S. Hirschberg:
Serial computations of Levenshtein distances. Pattern Matching Algorithms 1997: 123-141 - Alberto Apostolico, Mikhail J. Atallah:
Parallel computations of Levenshtein distances. Pattern Matching Algorithms 1997: 143-184 - Gad M. Landau, Uzi Vishkin:
Approximate string searching. Pattern Matching Algorithms 1997: 185-199 - Raffaele Giancarlo:
Dynamic programming: special cases. Pattern Matching Algorithms 1997: 201-236 - Ming Li, Tao Jiang:
Shortest common superstrings. Pattern Matching Algorithms 1997: 237-265 - Amihood Amir, Martin Farach:
Two dimensional matching. Pattern Matching Algorithms 1997: 267-292 - Raffaele Giancarlo, Roberto Grossi:
Suffix tree data structures for matrices. Pattern Matching Algorithms 1997: 293-340 - Kaizhong Zhang, Dennis E. Shasha:
Tree pattern matching. Pattern Matching Algorithms 1997: 341-371
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-22 19:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
