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

Nikolic, Bojan; Aleksandar, Kartelj; Djukanovic, Marko; Grbic, Milana; Blum, Christian; Raidl, Guenther

by Bojan Nikolic, Kartelj Aleksandar, Marko Djukanovic, Milana Grbic, Christian Blum, Guenther Raidl

Reference:

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

Bibtex Entry:

@string{ac="Algorithms and Complexity Group, TU Wien"}
@TechReport{NikKartDjukGrbBluRai21tr,
	author = {Nikolic, Bojan and Kartelj Aleksandar and Djukanovic, Marko and  Grbic, Milana and Blum, Christian and Raidl, Guenther},
	title = {Solving the Longest Common Subsequence Problem Concerning Non-uniform Distributions of Letters in Input Strings},
	institution  = AC,
	year = {2021},
	number       = {AC-TR-21-009},
	url = {http://www.ac.tuwien.ac.at/files/tr/ac-tr-21-009.pdf}
}