People
Research
Courses
Updates
Jobs
Contact
Internal
Light
Dark
Automatic
An A* Search Algorithm for the Constrained Longest Common Subsequence Problem
Marko Djukanovic
,
Christoph Berger
,
Günther Raidl
,
Christian Blum
January 2020
PDF
Cite
DOI
Type
Journal Article
Günther Raidl
Günther Raidl is a Professor at the Algorithms and Complexity Group.
Cite
×