A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem

Christian Blum, Carlos Cotta, Antonio J. Fernández, José E. Gallardo. A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem. In Carlos Cotta, Jano I. van Hemert, editors, Evolutionary Computation in Combinatorial Optimization, 7th European Conference, EvoCOP 2007, Valencia, Spain, April 11-13, 2007, Proceedings. Volume 4446 of Lecture Notes in Computer Science, pages 36-47, Springer, 2007. [doi]

Abstract

Abstract is missing.