Faster Recovery of Approximate Periods over Edit Distance.
Tomasz KociumakaJakub RadoszewskiWojciech RytterJuliusz StraszynskiTomasz WalenWiktor ZubaPublished in: CoRR (2018)
Keyphrases
- edit distance
- approximate matching
- tree edit distance
- distance computation
- graph matching
- similarity measure
- edit operations
- approximate string matching
- distance function
- string similarity
- levenshtein distance
- dynamic programming
- string matching
- graph edit distance
- longest common subsequence
- distance measure
- subgraph isomorphism
- tree structured data
- optimal solution
- computer vision
- feature space
- nearest neighbor
- string edit distance