Efficient top-k algorithms for approximate substring matching.
Younghoon KimKyuseok ShimPublished in: SIGMOD Conference (2013)
Keyphrases
- orders of magnitude
- computationally efficient
- benchmark datasets
- genetic algorithm
- data structure
- theoretical analysis
- graph theory
- recently developed
- times faster
- computational efficiency
- pattern matching
- neural network
- optimization problems
- computational cost
- learning algorithm
- graphical models
- keypoints
- computational complexity
- image processing
- approximate matching