Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem

Blum, Christian; Djukanovic, Marko; Santini, Alberto; Jiang, Hua; Li, Chu-Min; Manya, Felipe; Raidl, Günther R.

by Christian Blum, Marko Djukanovic, Alberto Santini, Hua Jiang, Chu-Min Li, Felipe Manya, Günther R. Raidl

Reference:

Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique ProblemChristian Blum, Marko Djukanovic, Alberto Santini, Hua Jiang, Chu-Min Li, Felipe Manya, Günther R. Raidl2020, Technical report AC-TR-20-003, Algorithms and Complexity Group, TU Wien.

Bibtex Entry:

@TechReport{BlumDjukSantJiLiManyaRaidl-20tr,
	author = {Christian Blum and Marko Djukanovic and Alberto Santini and Hua Jiang and Chu-Min Li and Felipe Manya and G\"unther R. Raidl},
	title = {Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem},
institution  = {Algorithms and Complexity Group, TU Wien},
year         = {2020},
number       = {AC-TR-20-003},
url          = {http://www.ac.tuwien.ac.at/files/tr/ac-tr-20-003.pdf},
}