Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem

Christian Blum, Marko Djukanovic, Alberto Santini, Hua Jiang, Chu-Min Li, Felipe Manya, Günther Raidl
January 2020
PDF bib DOI

Abstract

Full Citation:

Christian Blum, Marko Djukanovic, Alberto Santini, Hua Jiang, Chu-Min Li, Felipe Manya, Günter R. Raidl. Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem. Computers & Operations Research, volume 125, number 105089, 2020. (Note: previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-20-003.pdf)

Type
Journal Article
Günther Raidl
Günther Raidl

Günther Raidl is a Professor at the Algorithms and Complexity Group.