Tighter Upper Bounds on the Exact Complexity of String Matching.
Richard ColeRamesh HariharanPublished in: SIAM J. Comput. (1997)
Keyphrases
- upper bound
- string matching
- worst case
- lower bound
- exact and approximate
- pattern matching
- upper and lower bounds
- approximate string matching
- branch and bound
- edit distance
- lower and upper bounds
- efficiently computable
- approximate matching
- suffix tree
- suffix array
- approximate pattern matching
- database
- aho corasick
- pattern matching algorithm
- regular expressions
- management system
- pattern recognition
- optimal solution
- objective function