Finding Longest Common Subsequences: New A* Anytime Results

Marko Djukanovic, Günther Raidl, Christian Blum
January 2019
PDF bib

Abstract

Full Citation:

Marko Djukanovic, Günther R. Raidl, Christian Blum. Finding Longest Common Subsequences: New A Anytime Results*. 2019, Technical report AC-TR-19-008, 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.