Solving the Generalized Constrained Longest Common Subsequence Problem with Many Pattern Strings

Abstract

Full Citation:

Djukanovic, Marko, Kartelj Aleksandar, Matic, Dragan,, Grbic, Milana, Blum, Christian, Raidl, Guenther. Solving the Generalized Constrained Longest Common Subsequence Problem with Many Pattern Strings. 2021, Technical report AC-TR-21-008, Algorithms and Complexity Group, TU Wien.

Günther Raidl
Günther Raidl

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