An A* search algorithm for the constrained longest common subsequence problem

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

doi:https://doi.org/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, pages 106041, 2020.Note: previous technical report version at https://www.ac.tuwien.ac.at/files/tr/ac-tr-20-004.pdf

Bibtex Entry:

@article{DJUKANOVIC2020106041,
	title = "An {A*} search algorithm for the constrained longest common subsequence problem",
	journal = {Information Processing Letters}, 
	pages = {106041},
	year = {2020},
	issn = {0020-0190},
	doi = {https://doi.org/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}},
}