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]
@article{FreschiB04,
title = {Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism},
author = {Valerio Freschi and Alessandro Bogliolo},
year = {2004},
doi = {10.1016/j.ipl.2004.02.011},
url = {http://dx.doi.org/10.1016/j.ipl.2004.02.011},
researchr = {https://researchr.org/publication/FreschiB04},
cites = {0},
citedby = {0},
journal = {Inf. Process. Lett.},
volume = {90},
number = {4},
pages = {167-173},
}