Ahsan, S. B. (2011) “Computing a Longest Common Subsequence of two strings when one of them is Run Length Encoded”, INFOCOMP Journal of Computer Science, 10(3), pp. 48–55. Available at: http://177.105.60.18/index.php/infocomp/article/view/337 (Accessed: 5 October 2024).