Anytime Algorithms for the Longest Common Palindromic Subsequence Problem

Djukanovic, Marko; Raidl, Günther; Blum, Christian

by Marko Djukanovic, Günther Raidl, Christian Blum

Reference:

Anytime Algorithms for the Longest Common Palindromic Subsequence ProblemMarko Djukanovic, Günther Raidl, Christian Blum2018, Technical report AC-TR-18-012, Algorithms and Complexity Group, TU Wien.

Bibtex Entry:

@TechReport{DjukanovicRaidlBlum18tra,
	author       = {Marko Djukanovic and G\"{u}nther Raidl and Christian Blum},
	title        = {Anytime Algorithms for the Longest Common Palindromic Subsequence Problem},
	institution  = {Algorithms and Complexity Group, TU Wien},
	year         = 2018,
	number    = {AC-TR-18-012},
	url = {http://www.ac.tuwien.ac.at/files/tr/ac-tr-18-012.pdf},
}