This paper proposes a hybrid Greedy Randomized Adaptive Search Procedure with path-relinking for the maximum contact map overlap problem, an NP-hard combinatorial optimization problem that arises in computational biology. Preliminary experimental results illus- trate the effectiveness and efficiency of the algorithm.
GRASP with Path-Relinking for the Maximum Contact Map Overlap ProblemLearning and Intelligent Optimization / Ricardo M. A., Silva; Mauricio G. C., Resende; Festa, Paola; Filipe L., Valentim; Francisco N., Junior. - 8426:(2014), pp. 223-226. [10.1007/978-3-319-09584-4_21]
GRASP with Path-Relinking for the Maximum Contact Map Overlap ProblemLearning and Intelligent Optimization
FESTA, PAOLA;
2014
Abstract
This paper proposes a hybrid Greedy Randomized Adaptive Search Procedure with path-relinking for the maximum contact map overlap problem, an NP-hard combinatorial optimization problem that arises in computational biology. Preliminary experimental results illus- trate the effectiveness and efficiency of the algorithm.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
