1.
Ahsan SB, Moosa TM, Rahman MS, Shahriyar S. Computing a Longest Common Subsequence of two strings when one of them is Run Length Encoded. INFOCOMP Journal of Computer Science [Internet]. 2011 Sep. 1 [cited 2024 Mar. 29];10(3):48-55. Available from: https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/337