Abstract
The Far From Most Strings Problem (FFMSP) asks for a string that 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 far if their Hamming distance is greater than or equal to a given threshold. FFMSP belongs to the class of sequence consensus problems which have applications in molecular biology, amongst others. FFMSP is NP-hard. It does not admit a constant-ratio approximation either, unless P=NP. In the last few years, heuristic and metaheuristic algorithms have been proposed for the problem, which use local search and require a heuristic, also called an evaluation function, to evaluate candidate solutions during local search. The heuristic function used, for this purpose, in these algorithms is the problem’s objective function. However, since many candidate solutions can be of the same objective value, the resulting search landscape includes many points which correspond to local maxima. In this paper, we devise a new heuristic function to evaluate candidate solutions. We then incorporate the proposed heuristic function within a Greedy Randomized Adaptive Search Procedure (GRASP), a metaheuristic originally proposed for the problem by Festa. The resulting algorithm outperforms state-of-the-art with respect to solution quality, in some cases by orders of magnitude, on both random and real data in our experiments. The results indicate that the number of local optima is considerably reduced using the proposed heuristic.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ashlock, D.: Evolutionary Computation for Modeling and Optimization. Springer, Berlin (2006)
Babaie, M., Mousavi, S.R.: A memetic algorithm for closest string problem and farthest string problem. In: Electrical Engineering (ICEE), 2010 18th Iranian Conference on (2010), pp. 570 –575, 11–13
Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput. Surv. 35(3), 268–308 (2003)
Chen, J.-C.: Iterative rounding for the closest string problem. In: CoRR, arXiv:0705.0561v2 (2007)
Cheng, C.H., Huang, C.C., Hu, S.Y., Chao, K.: Efficient algorithms for some variants of the farthest string problem. In: 21st Workshop on Combinatorial Mathematics and Computation Theory, pp. 266–273 (2004)
Cohen, G.D., Karpovsky, M.G., Jr, H.F.M., Schatz, J.R. Covering radius—survey and recent results. IEEE Trans. Inf. Theory 31(3), 328–343 (1985)
Crooke, S.T., Lebleu, B.: Antisense Research and Applications. CRC Press, Boca Raton (1993)
de Meneses, C.N., Lu, Z., Oliveira, C.A.S., Pardalos, P.M.: Optimal solutions for the closest-string problem via integer programming. INFORMS J. Comput. 16(4), 419–429 (2004)
Edwards, A.W.F.: Pascal’s Arithmetical Triangle: The Story of a Mathematical Idea. Johns Hopkins University Press, Baltimore (2002)
Feo, T., Resende, M.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8, 67–71 (1989)
Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6(2), 109–133 (1995)
Festa, P.: On some optimization problems in molecular biology. Math. Biosci. 207(2), 219–234 (2007). BIOCOMP2005 Special Issue
Festa, P., Resende, M.: Grasp: An annotated bibliography. In: Essays and Surveys on Metaheuristics, pp. 325–367. Kluwer Academic, Amsterdam (2002)
Festa, P., Resende, M.G.C.: An annotated bibliography of GRASP; Part I: Algorithms. Int. Trans. Oper. Res. 16(1), 1–24 (2009)
Fogel, D.B.: Evolutionary Computation: Toward a New Philosophy of Machine Intelligence, 3rd edn. IEEE Press, New York (2006)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, Amsterdam (1997)
Gomes, F.C., de Meneses, C.N., Pardalos, P.M., Viana, G.V.R.: A parallel multistart algorithm for the closest string problem. Comput. OR 35(11), 3636–3643 (2008)
Gramm, J.: Closest substring. In: Kao, M.-Y. (ed.) Encyclopedia of Algorithms, p. 156-8. Springer, Berlin (2008)
Gramm, J., Guo, J., Niedermeier, R.: On exact and approximation algorithms for distinguishing substring selection. In: FCT, pp. 195–209 (2003)
Gramm, J., Hüffner, F., Niedermeier, R.: Closest strings, primer design, and motif search. In: Sixth Annual International Conference on Computational Molecular Biology, pp. 74–75 (2002)
Gramm, J., Niedermeier, R., Rossmanith, P.: Fixed-parameter algorithms for closest string and related problems. Algorithmica 37(1), 25–42 (2003)
Lanctot, J.K.: Some string problems in computational biology. PhD thesis, Univesity of Waterloo (2000)
Lanctot, J.K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string selection problems. In: SODA ’99: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 633–642. Society for Industrial and Applied Mathematics, Philadelphia (1999)
Lanctot, J.K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string selection problems. Inf. Comput. 185(1), 41–55 (2003)
Li, M., Ma, B., Wang, L.: Finding similar regions in many strings. In: STOC ’99: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, pp. 473–482. ACM, New York (1999)
Li, M., Ma, B., Wang, L.: On the closest string and substring problem. J. ACM 49(2), 157–171 (2002)
Ma, B., Sun, X.: More efficient algorithms for closest string and substring problems. In: Research in Computational Molecular Biology: 12th Annual International Conference RECOMB 2008, pp. 396–409 (2008)
Macario, A.J.L., de Macario, E.C.: Gene probes for bacteria. Academic Press, New York (1990)
Meneses, C.N., Oliveira, C.A.S., Pardalos, P.M.: Optimization techniques for string selection and comparison problems in genomics. IEEE Eng. Med. Biol. Mag. 24(3), 81–87 (2005)
Meneses, C.N., Pardalos, P.M., Resende, M.G.C., Vazacopoulos, A.: Modeling and solving string selection problems. In: Second International Symposium on Mathematical and Computational Biology, pp. 54–64 (2005)
Peelle, H.A.: Euclid, Fibonacci, and Pascal recursed. Int. J. Math. Educ. Sci. Technol. 6(4), 395–405 (1975)
Russel, S., Norvig, P.: Artificial Intelligence: A Modern Approach, 2nd edn. Prentice-Hall, New York (2003)
Sahinalp, S.C., Muthukrishnan, S., Dogrusöz, U. (eds.): Combinatorial Pattern Matching. In: Proceedings 15th Annual Symposium, CPM 2004, Istanbul,Turkey, 5–7 July 2004. Lecture Notes in Computer Science, vol. 3109. Springer, Berlin (2004)
Wang, J., Chen, J., Huang, J.M.: An improved lower bound on approximation algorithms for the closest substring problem. Inf. Process. Lett. 107(1), 24–28 (2008)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Mousavi, S.R., Babaie, M. & Montazerian, M. An improved heuristic for the far from most strings problem. J Heuristics 18, 239–262 (2012). https://doi.org/10.1007/s10732-011-9177-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10732-011-9177-z