An Efficient Probabilistic Population-Based Descent for the Median Genome Problem
Idioma
en
Communication dans un congrès
Este ítem está publicado en
Proceedings of the 10th annual ACM SIGEVO conference on Genetic and evolutionary computation (GECCO 2008), Proceedings of the 10th annual ACM SIGEVO conference on Genetic and evolutionary computation (GECCO 2008), GECCO: Genetic And Evolutionary Computation Conference, 2008-08, Atlanta. 2008p. 315-322
ACM
Resumen en inglés
We present a novel population-based local search algorithm for the {\em median genome problem}. The primary result of this article is that this probabilistic approach significantly improves the performance of ancestral ...Leer más >
Palabras clave en inglés
Median Genome Problem
probabilistic neighborhood
local search