A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation

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

doi:https://doi.org/10.1007/978-3-030-37599-7_14

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

Reference:

A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length CalculationMarko Djukanovic, Günther R Raidl, Christian BlumProceedings of LOD 2019 – The 5th International Conference on Machine Learning, Optimization and Data Science (Giuseppe Nicosia, Panos Pardalos, Giovanni Giuffrida, Renato Umeton, Vincenzo Sciacca, eds.), volume 11943 of LNCS, pages 154–167, 2020, Springer.

Bibtex Entry:

@InProceedings{djukanovic-19b,
    title     = {A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation},
	author    = {Djukanovic, Marko and Raidl, G{\"u}nther R and Blum, Christian},
    booktitle = {Proceedings of {LOD} 2019 -- The 5th International Conference on Machine
	Learning, Optimization and Data Science},
	editor    = {Nicosia, Giuseppe and Pardalos, Panos and  Giuffrida, Giovanni and Umeton, Renato and Sciacca, Vincenzo},
	publisher = {Springer},
	series = {LNCS},
	pages     = {154--167},
	volume    = {11943},
	year = 2020,
	doi       = {https://doi.org/10.1007/978-3-030-37599-7_14},
url={https://www.ac.tuwien.ac.at/files/pub/djukanovic-19b.pdf},
}