Indexed Dynamic Programming to Boost Edit Distance and LCSS Computation.
Jérémy BarbayAndrés OlivaresPublished in: SPIRE (2018)
Keyphrases
- edit distance
- dynamic programming
- subgraph isomorphism
- edit operations
- similarity measure
- string matching
- distance measure
- graph matching
- levenshtein distance
- string edit distance
- approximate string matching
- distance function
- distance computation
- graph edit distance
- string similarity
- approximate matching
- longest common subsequence
- dissimilarity measure
- tree edit distance
- data structure
- nearest neighbor
- data analysis