1. 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)
2. Blum, C., Festa, P.: Metaheuristics for String Problems in Bio-Informatics. Wiley, Hoboken (2016)
3. Djukanovic, M., Raidl, G., Blum, C.: Anytime algorithms for the longest common palindromic subsequence problem. Technical report AC-TR-18-012, Algorithms and Complexity Group, TU Wien (2018)
4. Huang, K., Yang, C.-B., Tseng, K.-T., et al.: Fast algorithms for finding the common subsequence of multiple sequences. In: Proceedings of the International Computer Symposium, pp. 1006–1011. IEEE Press (2004)
5. Inoue, T., Inenaga, S., Hyyrö, H., Bannai, H., Takeda, M.: Computing longest common square subsequences. In: Proceedings of CPM 2018–29th Annual Symposium on Combinatorial Pattern Matching. Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl Publishing (2018)