A sum-over-paths extension of edit distances accounting for all sequence alignments.
Silvia García-DíezFrançois FoussMasashi ShimboMarco SaerensPublished in: Pattern Recognit. (2011)
Keyphrases
- edit distance
- edit operations
- sequence alignment
- string matching
- longest common subsequence
- pairwise
- approximate matching
- levenshtein distance
- tree edit distance
- distance function
- graph matching
- multiple sequence alignment
- global alignment
- graph kernels
- objective function
- similarity measure
- minimal cost
- subgraph isomorphism
- approximate string matching
- shortest path
- distance measure
- dynamic programming
- neural network