A Heuristic Approach for Solving the Longest Common Square Subsequence Problem

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

doi:https://doi.org/10.1007/978-3-030-45093-9_52

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

Reference:

A Heuristic Approach for Solving the Longest Common Square Subsequence ProblemMarko Djukanovic, Günther R. Raidl, Christian BlumProceedings of EUROCAST 2019 – 17th International Conference on Computer Aided Systems Theory (Roberto Moreno-Díaz, Franz Pichler, Alexis Quesada-Arencibia, eds.), volume 12013 of LNCS, pages 429-437, 2019, Springer.

Bibtex Entry:

@inproceedings{djukanovic-19a,
	title = {A Heuristic Approach for Solving the Longest Common Square Subsequence Problem},
	author = {Djukanovic, Marko and  Raidl, G{\"{u}}nther R. and Blum, Christian},
	booktitle = {Proceedings of {EUROCAST} 2019 -- 17th International Conference on Computer Aided Systems Theory},
	editor = {Moreno-D\'{i}az, Roberto and Pichler, Franz and Quesada-Arencibia, Alexis},
	volume= {12013},
	pages={429-437},
	year = {2019},
	publisher = {Springer},
	series = {LNCS},
    doi={https://doi.org/10.1007/978-3-030-45093-9_52}
}