A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem

The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel randomized search strategy, called probabilistic beam search (PBS), based on the hybridization between beam search and greedy constructive heuristics. PBS is competitive (and sometimes better than) previous state-of-the-art algorithms for solving the SCSP. The paper describes PBS and provides an experimental analysis (including comparisons with previous approaches) that demonstrate its usefulness.

[1]  Jeong Seop Sim,et al.  The consensus string problem for a metric is NP-complete , 2003, J. Discrete Algorithms.

[2]  Martin Middendorf,et al.  Searching for Shortest Common Supersequences by Means of a Heuristic-Based Genetic Algorithm , 1996 .

[3]  Carlos Cotta,et al.  On the Hybridization of Memetic Algorithms With Branch-and-Bound Techniques , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[4]  Jürgen Branke,et al.  Improved heuristics and a genetic algorithm for finding short supersequences , 1998 .

[5]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[6]  Krzysztof Pietrzak,et al.  On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems , 2003, J. Comput. Syst. Sci..

[7]  Qiang Yang,et al.  Theory and Algorithms for Plan Merging , 1992, Artif. Intell..

[8]  Rolf Niedermeier,et al.  A general method to speed up fixed-parameter-tractable algorithms , 2000, Inf. Process. Lett..

[9]  Sven Rahmann.  The shortest common supersequence problem in a microarray production setting , 2003, ECCB.

[10]  Martin Middendorf.  More on the Complexity of Common Superstring and Supersequence Problems , 1994, Theor. Comput. Sci..

[11]  P. Ow,et al.  Filtered beam search in scheduling , 1988 .

[12]  Weijia Jia,et al.  Vertex Cover: Further Observations and Further Improvements , 1999, J. Algorithms.

[13]  Carlos Cotta,et al.  A Comparison of Evolutionary Approaches to the Shortest Common Supersequence Problem , 2005, IWANN.

[14]  Michael R. Fellows,et al.  The Parameterized Complexity of Sequence Alignment and Consensus , 1994, CPM.

[15]  V. G. Timkovskii.  Complexity of common subsequence and supersequence problems and related problems , 1989 .

[16]  Carlos Cotta,et al.  Memetic Algorithms with Partial Lamarckism for the Shortest Common Supersequence Problem , 2005, IWINAC.

[17]  Michael Trevor Hallett.  An integrated complexity analysis of problems from computational biology , 1998 .