Talks and Poster Presentations (without Proceedings-Entry):
M. Horn, M. Djukanovic, C. Blum, G. Raidl:
"On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences";
Talk: CPAIOR 2020,
The goal of the repetition-free longest common subsequence (RFLCS) problem is to find a longest sequence which is common to two input strings such that each character in the common subsequence appears at most once. In this work, the RFLCS problem is solved by
transforming an instance to an instance of the maximum independent set (MIS) problem which is then solved by a mixed integer linear programming solver. To reduce the size of the underlying conflict graph of the MIS problem, a relaxed decision diagram is utilized.
Electronic version of the publication:
Created from the Publication Database of the Vienna University of Technology.