Login / Signup
Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism.
Valerio Freschi
Alessandro Bogliolo
Published in:
Inf. Process. Lett. (2004)
Keyphrases
</>
run length
longest common subsequence
matching algorithm
np hard
similarity measure
optimal solution
computational complexity
similarity function
dynamic time warping
objective function
pairwise
dynamic programming
segmentation algorithm
texture features
sequence matching