On the k-Hamming and k-Edit Distances.
Chiara EpifanioLuca ForlizziFrancesca MarziFilippo MignosiGiuseppe PlacidiMatteo SpezialettiPublished in: CoRR (2023)
Keyphrases
- edit distance
- hamming distance
- distance measure
- string matching
- graph matching
- edit operations
- similarity measure
- distance function
- approximate string matching
- dissimilarity measure
- approximate matching
- dynamic programming
- tree structured data
- levenshtein distance
- distance computation
- subgraph isomorphism
- feature extraction
- similarity search
- nearest neighbor
- tree edit distance
- pattern recognition