Ahsan, Shegufta Bakht, Tanaeem M. Moosa, M. Sohel Rahman, and Shampa Shahriyar. “Computing a Longest Common Subsequence of Two Strings When One of Them Is Run Length Encoded”. INFOCOMP Journal of Computer Science 10, no. 3 (September 1, 2011): 48–55. Accessed October 5, 2024. http://177.105.60.18/index.php/infocomp/article/view/337.