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

Günther Raidl
Günther Raidl

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