Tight Comparison Bounds for the String Prefix-Matching Problem.
Dany BreslauerLivio ColussiLaura TonioloPublished in: Inf. Process. Lett. (1993)
Keyphrases
- upper bound
- lower bound
- pattern matching
- string matching
- data structure
- worst case
- approximate string matching
- lower and upper bounds
- graph matching
- bit parallel
- upper and lower bounds
- matching process
- matching algorithm
- shape matching
- edit distance
- keypoints
- feature points
- object recognition
- matching scheme
- optimal solution
- generalization error bounds
- databases