Tighter Lower Bounds on the Exact Complexity of String Matching.
Richard ColeRamesh HariharanMike PatersonUri ZwickPublished in: SIAM J. Comput. (1995)
Keyphrases
- lower bound
- string matching
- exact and approximate
- upper bound
- worst case
- pattern matching
- branch and bound
- objective function
- np hard
- edit distance
- lower and upper bounds
- approximate string matching
- suffix tree
- aho corasick
- approximate matching
- neural network
- regular expressions
- optimal solution
- point correspondences
- building blocks
- databases