Solving longest common subsequence problems via a transformation to the maximum clique problem

Christian Blum 0001, Marko Djukanovic, Alberto Santini, Hua Jiang, Chu Min Li, Felip Manyà, Günter R. Raidl. Solving longest common subsequence problems via a transformation to the maximum clique problem. Computers & OR, 125:105089, 2021. [doi]

Abstract

Abstract is missing.