A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings.
Kuan-Yu ChenKun-Mao ChaoPublished in: ESA (1) (2010)
Keyphrases
- edit distance
- run length
- string matching
- levenshtein distance
- edit operations
- run length encoding
- similarity measure
- objective function
- computational complexity
- dynamic programming
- worst case
- approximate matching
- tree edit distance
- suffix array
- matching algorithm
- longest common subsequence
- distance measure
- np hard
- feature extraction
- convex hull
- computer vision
- principal component analysis
- optimal solution