Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem

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

Abstract

Full Citation:

Marko Djukanovic, Günther R. Raidl, Christian Blum. Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem. Proceedings of LION~12 – the 12th International Conference on Learning and Intelligent Optimization, volume 11353 of LNCS, pages 199-214, 2019, Springer.

Type
Conference Paper
Günther Raidl
Günther Raidl

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