An A* Search Algorithm for the Constrained Longest Common Subsequence Problem

Djukanovic, Marko; Berger, Christoph; Raidl, Günther R.; Blum, Christian

doi:10.1016/j.ipl.2020.106041

by Marko Djukanovic, Christoph Berger, Günther R. Raidl, Christian Blum

Reference:

An A* Search Algorithm for the Constrained Longest Common Subsequence ProblemMarko Djukanovic, Christoph Berger, Günther R. Raidl, Christian BlumInformation Processing Letters, volume 166, number 106041, 2020.Note: previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-20-004.pdf

Bibtex Entry:

@article{djukanovic-20,
	title = "An {A*} Search Algorithm for the Constrained Longest Common Subsequence Problem",
	journal = {Information Processing Letters}, 
	number = {106041},
  volume = 166,
	year = {2020},
	doi = {10.1016/j.ipl.2020.106041},
	url = {http://www.sciencedirect.com/science/article/pii/S0020019020301289},
	author = {Marko Djukanovic and Christoph Berger and Günther R. Raidl and Christian Blum}, 
    note = {previous technical report version at \url{https://www.ac.tuwien.ac.at/files/tr/ac-tr-20-004.pdf}},
}