Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism

Valerio Freschi, Alessandro Bogliolo. Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism. Inf. Process. Lett., 90(4):167-173, 2004. [doi]

Abstract

Abstract is missing.