1. Adi, S.S.: Repetition-free longest common subsequence. Discr. Appl. Math. 158(12), 1315–1324 (2010)
2. Blum, C., Blesa, M.J., López-Ibáñez, M.: Beam search for the longest common subsequence problem. Comput. Oper. Res. 36(12), 3178–3186 (2009)
3. Chowdhury, S.R., Hasan, M., Iqbal, S., Rahman, M.S.: Computing a longest common palindromic subsequence. Fund. Inform. 129(4), 329–340 (2014)
4. Deorowicz, S.: Bit-parallel algorithm for the constrained longest common subsequence problem. Fund. Inform. 99(4), 409–433 (2010)
5. Deorowicz, S., Obstój, J.: Constrained longest common subsequence computing algorithms in practice. Comput. Inf. 29(3), 427–445 (2012)