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

Abstract

Full Citation:

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

Günther Raidl

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