k-Approximate Quasiperiodicity under Hamming and Edit Distance.
Aleksander KedzierskiJakub RadoszewskiPublished in: CPM (2020)
Keyphrases
- edit distance
- approximate matching
- tree edit distance
- hamming distance
- distance measure
- distance computation
- edit operations
- graph matching
- approximate string matching
- string matching
- similarity measure
- levenshtein distance
- string edit distance
- distance function
- string similarity
- tree structured data
- dissimilarity measure
- similarity join
- graph edit distance
- triangle inequality
- subgraph isomorphism
- dynamic programming
- finite alphabet
- np hard
- reinforcement learning