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

Abstract

Full Citation:

Marko Djukanovic, Günther R Raidl, Christian Blum. A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation. Proceedings 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.

Günther Raidl

Günther Raidl is a Professor at the Algorithms and Complexity Group.