On the Hardness of Computing the Edit Distance of Shallow Trees.
Panagiotis CharalampopoulosPawel GawrychowskiShay MozesOren WeimannPublished in: SPIRE (2022)
Keyphrases
- edit distance
- tree edit distance
- edit operations
- tree structured data
- graph matching
- similarity measure
- string matching
- approximate string matching
- distance function
- string edit distance
- string similarity
- graph edit distance
- levenshtein distance
- distance measure
- computational complexity
- approximate matching
- distance computation
- relaxation labeling
- dynamic programming
- tree structure
- triangle inequality
- tree structures
- dissimilarity measure
- machine learning
- minimal cost
- neural network
- lower bound