People
Research
Courses
Updates
Jobs
Contact
Internal
Light
Dark
Automatic
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
Cite
DOI
Type
Journal Article
Günther Raidl
Günther Raidl is a Professor at the Algorithms and Complexity Group.
Cite
×