Simulating Branching Programs with Edit Distance and Friends or: A Polylog Shaved is a Lower Bound Made.
Amir AbboudThomas Dueholm HansenVirginia Vassilevska WilliamsRyan WilliamsPublished in: CoRR (2015)
Keyphrases
- edit distance
- lower bound
- lower bounding
- upper bound
- graph matching
- edit operations
- string matching
- approximate string matching
- similarity measure
- lower and upper bounds
- branch and bound algorithm
- dynamic time warping
- distance function
- distance measure
- tree structured data
- np hard
- string edit distance
- string similarity
- tree edit distance
- optimal solution
- levenshtein distance
- approximate matching
- graph edit distance
- distance computation
- worst case
- objective function
- triangle inequality
- subgraph isomorphism
- neural network
- similarity join
- machine learning
- dynamic programming
- pattern recognition
- data sets