On the k-Hamming and k-Edit Distances.
Chiara EpifanioLuca ForlizziFrancesca MarziFilippo MignosiGiuseppe PlacidiMatteo SpezialettiPublished in: ICTCS (2023)
Keyphrases
- edit distance
- hamming distance
- distance measure
- similarity measure
- edit operations
- graph matching
- distance function
- string matching
- levenshtein distance
- approximate string matching
- approximate matching
- dynamic programming
- subgraph isomorphism
- tree edit distance
- adjacency matrix
- support vector machine
- feature extraction
- tree structured data
- image processing
- neural network