by Marko Djukanovic, Günther R. Raidl, Christian Blum
Reference:
Finding Longest Common Subsequences: New A* Anytime ResultsMarko Djukanovic, Günther R. Raidl, Christian Blum2019, Technical report AC-TR-19-008, Algorithms and Complexity Group, TU Wien.
Bibtex Entry:
@TechReport{djrb_lcs_anytime_2019,
author = {Marko Djukanovic and Günther R. Raidl and Christian Blum},
title = {Finding Longest Common Subsequences: New A* Anytime Results},
institution = {Algorithms and Complexity Group, TU Wien},
year = {2019},
number = {AC-TR-19-008},
url = {http://www.ac.tuwien.ac.at/files/tr/ac-tr-19-008.pdf},
}