Anytime Algorithms for the Longest Common Palindromic Subsequence Problem

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

Abstract

Full Citation:

Marko Djukanovic, Günther Raidl, Christian Blum. Anytime Algorithms for the Longest Common Palindromic Subsequence Problem. 2018, Technical report AC-TR-18-012, 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.