1. Ann, H.Y., Yang, C.B., Tseng, C.T., Hor, C.Y.: Fast algorithms for computing the constrained LCS of run-length encoded strings. Theor. Comput. Sci. 432, 1–9 (2012)
2. Arslan, A.N., Eğecioğlu, Ö.: Algorithms for the constrained longest common subsequence problems. Int. J. Found. Comput. Sci. 16(06), 1099–1109 (2005)
3. Chin, F.Y.L., Santis, A.D., Ferrara, A.L., Ho, N.L., Kim, S.K.: A simple algorithm for the constrained sequence problems. Inform. Process. Lett. 90(4), 175–179 (2004)
4. Deorowicz, S.: Fast algorithm for the constrained longest common subsequence problem. Theor. Appl. Inform. 19(2), 91–102 (2007)
5. Ho, W.C., Huang, K.S., Yang, C.B.: A fast algorithm for the constrained longest common subsequence problem with small alphabet. In: Proceedings of the 34th Workshop on Combinatorial Mathematics and Computation Theory, Taichung, Taiwan, pp. 13–25 (2017)