Parallelisation of a multi-neighbourhood local search heuristic for a phylogeny problem.
In this work we study a phylogeny problem. That is, given a collection of organisms, we want to reconstruct the evolutionary history of the organisms. We are interested in inferring relationships between the organisms. For a number of reasonable biological hypotheses the problem becomes NP-hard. Besides that, the problem data is large enough to inhibit anyone using exact algorithms to solve, in practical computational time, real instances of the problem. In this work, we propose an innovative technique based on local search procedures that use multiple starts and diversified neighbourhoods.
Viana
G V R
GV
Universidade Federal do Ceara, Centro de Ciencias, Departamento de Computacao, Bloco 910, Campus do Pici, 60455-760, Fortaleza, CE, Brasil. valdisio@lia.ufc.br
Gomes
F A C
FA
Ferreira
C E
CE
Meneses
C N
CN