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

Abstract

Full Citation:

Christian Blum, Marko Djukanovic, Alberto Santini, Hua Jiang, Chu-Min Li, Felipe Manya, Günther R. Raidl. Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem. 2020, Technical report AC-TR-20-003, Algorithms and Complexity Group, TU Wien.

Type
Technical Report
Günther Raidl
Günther Raidl

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