On the Exact Complexity of String Matching: Upper Bounds.
Zvi GalilRaffaele GiancarloPublished in: SIAM J. Comput. (1992)
Keyphrases
- string matching
- upper bound
- exact and approximate
- worst case
- lower bound
- pattern matching
- approximate string matching
- suffix tree
- efficiently computable
- lower and upper bounds
- aho corasick
- edit distance
- upper and lower bounds
- suffix array
- regular expressions
- approximate matching
- branch and bound
- pattern matching algorithm
- clone detection
- computer vision