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

Abstract

Full Citation:

Nikolic, Bojan, Kartelj, Aleksandar, Djukanovic, Marko, Grbić, Milana, Blum, Christian, Raidl, Günther. Solving the Longest Common Subsequence Problem Concerning Non-Uniform Distributions of Letters in Input Strings. Mathematics, volume 9, number 13, 2021.

Günther Raidl

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