A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation

Jonas Mayerhofer, Markus Kirchweger, Marc Huber, Günther R. Raidl. A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation. In Leslie Pérez Cáceres, Sébastien Vérel, editors, Evolutionary Computation in Combinatorial Optimization - 22nd European Conference, EvoCOP 2022, Held as Part of EvoStar 2022, Madrid, Spain, April 20-22, 2022, Proceedings. Volume 13222 of Lecture Notes in Computer Science, pages 127-142, Springer, 2022. [doi]

Abstract

Abstract is missing.