[1]
S. B. Ahsan, T. M. Moosa, M. S. Rahman, and S. Shahriyar, “Computing a Longest Common Subsequence of two strings when one of them is Run Length Encoded”, INFOCOMP Journal of Computer Science, vol. 10, no. 3, pp. 48–55, Sep. 2011.