AHSAN, S. B.; MOOSA, T. M.; RAHMAN, M. S.; SHAHRIYAR, S. 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: https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/337. Acesso em: 19 apr. 2024.