A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings.
Kuan-Yu ChenKun-Mao ChaoPublished in: Algorithmica (2013)
Keyphrases
- edit distance
- run length
- string matching
- levenshtein distance
- edit operations
- similarity measure
- dynamic programming
- longest common subsequence
- optimal solution
- objective function
- suffix array
- run length encoding
- distance function
- tree edit distance
- computer vision
- input image
- worst case
- gray level
- np hard
- computational complexity
- approximate matching
- normalized edit distance