AHSAN, Shegufta Bakht; MOOSA, Tanaeem M.; RAHMAN, M. Sohel; SHAHRIYAR, Shampa. Computing a Longest Common Subsequence of two strings when one of them is Run Length Encoded. INFOCOMP Journal of Computer Science, [S. l.], v. 10, n. 3, p. 48–55, 2011. Disponível em: http://177.105.60.18/index.php/infocomp/article/view/337. Acesso em: 5 oct. 2024.