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. © 2013 Springer-Verlag.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
Titolo: | Hybrid metaheuristics for the far from most string problem |
Autori: | |
Data di pubblicazione: | 2013 |
Serie: | |
Handle: | http://hdl.handle.net/20.500.11770/307519 |
ISBN: | 978-3-642-38515-5 978-3-642-38516-2 |
Appare nelle tipologie: | 4.1 Contributo in Atti di convegno |