Marko Djukanovic, Günther R. Raidl, Christian Blum 0001. A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation. In Giuseppe Nicosia, Panos M. Pardalos, Renato Umeton, Giovanni Giuffrida, Vincenzo Sciacca, editors, Machine Learning, Optimization, and Data Science - 5th International Conference, LOD 2019, Siena, Italy, September 10-13, 2019, Proceedings. Volume 11943 of Lecture Notes in Computer Science, pages 154-167, Springer, 2019. [doi]
Abstract is missing.