Finding Longest Common Subsequences: New anytime A$^*$ Search Results (bibtex)
by , ,
Reference:
Finding Longest Common Subsequences: New anytime A$^*$ Search ResultsMarko Djukanovic, Günther R. Raidl, Christian BlumApplied Soft Computing, volume 95, number 106400, 2020.
Bibtex Entry:
@article{djukanovic-20g,
author = {Marko Djukanovic and G{\"u}nther R. Raidl and Christian Blum},
title = {Finding Longest Common Subsequences: New anytime A$^*$ Search Results},
journal = {Applied Soft Computing},
volume = 95,
number = {106400},
year = {2020},
url = {https://publik.tuwien.ac.at/files/publik_293653.pdf}
}
Powered by bibtexbrowser