An A* Search Algorithm for the Constrained Longest Common Subsequence Problem

Abstract

Full Citation:

Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum. An A Search Algorithm for the Constrained Longest Common Subsequence Problem*. Information Processing Letters, volume 166, number 106041, 2020. (Note: previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-20-004.pdf)

Günther Raidl

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