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

Marko Djukanovic, Christoph Berger, Günther Raidl, Christian Blum
January 2020
PDF bib

Abstract

Full Citation:

Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum. An A Search Algorithm for the Constrained Longest Common Subsequence Problem*. 2020, Technical report AC-TR-20-004, 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.