Tight Comparison Bounds for the String Prefix-Matching Problem.
Dany BreslauerLivio ColussiLaura TonioloPublished in: CPM (1993)
Keyphrases
- upper bound
- lower bound
- string matching
- worst case
- data structure
- pattern matching
- generalization error bounds
- matching process
- string similarity
- matching algorithm
- upper and lower bounds
- error bounds
- lower and upper bounds
- approximate string matching
- keypoints
- hamming distance
- neural network
- image matching
- graph matching
- shape matching
- regular expressions
- feature points
- approximate matching