Indexed Dynamic Programming to boost Edit Distance and LCSS Computation.
Jérémy BarbayAndrés OlivaresPublished in: CoRR (2018)
Keyphrases
- edit distance
- dynamic programming
- subgraph isomorphism
- similarity measure
- edit operations
- string matching
- graph matching
- string edit distance
- string similarity
- levenshtein distance
- approximate string matching
- distance measure
- distance function
- approximate matching
- graph edit distance
- tree structured data
- similarity join
- learning classifier systems
- dissimilarity measure
- tree edit distance
- longest common subsequence
- distance computation
- finite alphabet
- object recognition
- machine learning