Tighter Bounds on the Exact Complexity of String Matching (Extended Abstract)
Richard ColeRamesh HariharanPublished in: FOCS (1992)
Keyphrases
- extended abstract
- string matching
- exact and approximate
- upper bound
- lower bound
- worst case
- pattern matching
- edit distance
- aho corasick
- approximate matching
- suffix tree
- regular expressions
- upper and lower bounds
- approximate string matching
- neural network
- error tolerance
- pattern matching algorithm
- lower and upper bounds
- database
- relevance feedback
- search engine