Anytime Algorithms for the Longest Common Palindromic Subsequence Problem (bibtex)
by , ,
Reference:
Anytime Algorithms for the Longest Common Palindromic Subsequence ProblemMarko Djukanovic, Günther R. Raidl, Christian BlumComputers & Operations Research, volume 114, pages 104827, 2020, Elsevier.
Bibtex Entry:
@article{djukanovic-19c,
	author = {Marko Djukanovic and  G{\"{u}}nther R. Raidl and Christian Blum},
        title = {Anytime Algorithms for the Longest Common Palindromic Subsequence Problem},
	volume = {114},
	journal = {Computers \& Operations Research},
	doi = {https://doi.org/10.1016/j.cor.2019.104827},
	pages={104827},
	year={2020},
	publisher={Elsevier}
}
Powered by bibtexbrowser