On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences

Horn, Matthias, Djukanovic, Marko, Blum, Christian, Günther Raidl
January 2020
bib DOI

Abstract

Full Citation:

Horn, Matthias, Djukanovic, Marko, Blum, Christian, Raidl , Günther R.. On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences. Proceedings of OPTIMA 2020 – XI International Conference Optimization and Applications (Olenev, Nicholas and Evtushenko, Yuri and Khachay, Michael and Malkova, Vlasta), volume 12422 of LNCS, pages 134-149, 2020, Springer.

Type
Conference Paper
Günther Raidl
Günther Raidl

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