A Hybridization of Constructive Beam Search with Local Search for Far From Most Strings Problem

The Far From Most Strings Problem (FFMSP) is to obtain a string which is far from as many as possible of a given set of strings. All the input and the output strings are of the same length, and two strings are said to be far if their hamming distance is greater than or equal to a given positive integer. FFMSP belongs to the class of sequences consensus problems which have applications in molecular biology. The problem is NP-hard; it does not admit a constant-ratio approximation either, unless P = NP . Therefore, in addition to exact and approximate algorithms, (meta)heuristic algorithms have been proposed for the problem in recent years. On the other hand, in the recent years, hybrid algorithms have been proposed and successfully used for many hard problems in a variety of domains. In this paper, a new metaheuristic algorithm, called Constructive Beam and Local Search (CBLS), is investigated for the problem, which is a hybridization of constructive beam search and local search algorithms. More specifically, the proposed algorithm consists of two phases, the first phase is to obtain several candidate solutions via the constructive beam search and the second phase is to apply local search to the candidate solutions obtained by the first phase. The best solution found is returned as the final solution to the problem. The proposed algorithm is also similar to memetic algorithms in the sense that both use local search to further improve individual solutions. The CBLS algorithm is compared with the most recent published algorithm for the problem, GRASP, with significantly positive results; the improvement is by order of magnitudes in most cases. Keywords—Bioinformatics, Far From Most Strings Problem, Hybrid metaheuristics, Matheuristics, Sequences consensus problems.

[1]  Howard A. Peelle.  Euclid, Fibonacci, and Pascal--Recursed!. , 1975 .

[2]  Jianer Chen,et al.  An improved lower bound on approximation algorithms for the Closest Substring problem , 2008, Inf. Process. Lett..

[3]  Bin Ma,et al.  On the closest string and substring problems , 2002, JACM.

[4]  Mauricio G. C. Resende,et al.  Grasp: An Annotated Bibliography , 2002 .

[5]  Jens Gramm.  Closest Substring , 2008, Encyclopedia of Algorithms.

[6]  Panos M. Pardalos,et al.  A parallel multistart algorithm for the closest string problem , 2008, Comput. Oper. Res..

[7]  Bin Ma,et al.  Finding similar regions in many strings , 1999, STOC '99.

[8]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[9]  Mauricio G. C. Resende,et al.  An Annotated Bibliography of Grasp Part I: Algorithms , 2022 .

[10]  P. Pardalos,et al.  Optimization techniques for string selection and comparison problems in genomics , 2005, IEEE Engineering in Medicine and Biology Magazine.

[11]  Rolf Niedermeier,et al.  On Exact and Approximation Algorithms for Distinguishing Substring Selection , 2003, FCT.

[12]  Panos M. Pardalos,et al.  Optimal Solutions for the Closest-String Problem via Integer Programming , 2004, INFORMS J. Comput..

[13]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[14]  Stanley T. Crooke,et al.  Antisense Research and Applications , 1993 .

[15]  Rolf Niedermeier,et al.  Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems , 2003, Algorithmica.

[16]  Ming Li,et al.  Some string problems in computational biology , 2000 .

[17]  Kun-Mao Chao,et al.  Efficient Algorithms for Some Variants of the Farthest String Problem , 2006 .

[18]  Bin Ma,et al.  More Efficient Algorithms for Closest String and Substring Problems , 2008, SIAM J. Comput..

[19]  Sayyed Rasoul Mousavi,et al.  An improved heuristic for the far from most strings problem , 2012, J. Heuristics.

[20]  Panos M. Pardalos,et al.  MODELING AND SOLVING STRING SELECTION PROBLEMS , 2005 .

[21]  Bin Ma,et al.  Distinguishing string selection problems , 2003, SODA '99.

[22]  Rolf Niedermeier,et al.  Closest Strings, Primer Design, and Motif Search , 2010 .

[23]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[24]  Jing-Chao Chen,et al.  Iterative Rounding for the Closest String Problem , 2007, ArXiv.

[25]  Gérard D. Cohen,et al.  Covering radius - Survey and recent results , 1985, IEEE Trans. Inf. Theory.

[26]  P Festa,et al.  On some optimization problems in molecular biology. , 2007, Mathematical biosciences.

[27]  Seyed Rasoul Mousavi,et al.  A Memetic Algorithm for closest string problem and farthest string problem , 2010, 2010 18th Iranian Conference on Electrical Engineering.

[28]  Freda Kemp.  Pascal's Arithmetical Triangle: the Story of a Mathematical Idea , 2003 .