Finding a longest common subsequence between a run-length-encoded string and an uncompressed string.
Jia Jie LiuYue-Li WangRichard C. T. LeePublished in: J. Complex. (2008)
Keyphrases
- run length
- longest common subsequence
- edit distance
- gray level
- texture information
- regular expressions
- pattern matching
- sample size
- dynamic time warping
- data structure
- finite automata
- similarity measure
- graph matching
- context free grammars
- similarity function
- approximation algorithms
- image processing
- variable length