Ahsan, S. B., Moosa, T. M., Rahman, M. S., & Shahriyar, S. (2011). Computing a Longest Common Subsequence of two strings when one of them is Run Length Encoded. INFOCOMP Journal of Computer Science, 10(3), 48–55. Retrieved from https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/337