An Improved Algorithm for The k-Dyck Edit Distance Problem.
Dvir FriedShay GolanTomasz KociumakaTsvi KopelowitzEly PoratTatiana StarikovskayaPublished in: CoRR (2021)
Keyphrases
- edit distance
- graph matching
- distance function
- string matching
- edit operations
- distance measure
- similarity measure
- approximate string matching
- dynamic time warping
- graph edit distance
- string similarity
- levenshtein distance
- longest common subsequence
- subgraph isomorphism
- tree structured data
- string edit distance
- dissimilarity measure
- tree edit distance
- dynamic programming
- approximate matching
- data analysis
- similarity search
- natural language processing
- database systems
- data sets