Hybrid metaheuritics for the far from most string problem

D. Ferone, P. Festa, and M.G.C. Resende

Proceedings of Hybrid Metaheuristics 2013 (HM 2013),  Ischia, M.J. Blesa et al., (Eds.), Lecture Notes in Computer Science, vol. 7919, pp. 174-188, 2013., 2013.

ABSTRACT

Among the sequence selection and comparison problems, the Far From Most String Problem (FFMSP) is one of the computationally hardest with applications in several fields, including molecular biology where one is interested in creating diagnostic probes for bacterial infections or in discovering potential drug targets. In this article, several hybrid metaheuristics are described and tested. Extensive comparative experiments on a large set of randomly generated test instances indicate that these randomized hybrid techniques are both effective and efficient.

PDF file of full paper

DOI

Go back

Mauricio G.C. Resende's Home Page

Last modified: 1 June 2013

Copyright Notice