Solving the Longest Common Subsequence Problem Concerning Non-uniform Distributions of Letters in Input Strings

Nikolic, Bojan, Kartelj Aleksandar, Djukanovic, Marko, Grbic, Milana, Blum, Christian, Günther Raidl
January 2021
PDF bib

Abstract

Full Citation:

Nikolic, Bojan, Kartelj Aleksandar, Djukanovic, Marko, Grbic, Milana, Blum, Christian, Raidl, Guenther. Solving the Longest Common Subsequence Problem Concerning Non-uniform Distributions of Letters in Input Strings. 2021, Technical report AC-TR-21-009, Algorithms and Complexity Group, TU Wien.

Type
Technical Report
Günther Raidl
Günther Raidl

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