An Efficient Probabilistic Population-Based Descent for the Median Genome Problem
GOËFFON, Adrien
Models and Algorithms for the Genome [ MAGNOME]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Models and Algorithms for the Genome [ MAGNOME]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
NIKOLSKI, Macha
Models and Algorithms for the Genome [ MAGNOME]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Models and Algorithms for the Genome [ MAGNOME]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
SHERMAN, David James
Models and Algorithms for the Genome [ MAGNOME]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Models and Algorithms for the Genome [ MAGNOME]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
GOËFFON, Adrien
Models and Algorithms for the Genome [ MAGNOME]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Models and Algorithms for the Genome [ MAGNOME]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
NIKOLSKI, Macha
Models and Algorithms for the Genome [ MAGNOME]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Models and Algorithms for the Genome [ MAGNOME]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
SHERMAN, David James
Models and Algorithms for the Genome [ MAGNOME]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
< Reduce
Models and Algorithms for the Genome [ MAGNOME]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Language
en
Communication dans un congrès
This item was published in
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
English Abstract
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 ...Read more >
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 genome reconstruction compared to existing methods, making it possible to tackle problems where the contemporary genomes may contain many hundreds of markers. Moreover, our method is not limited to triples of genomes, and thus solves the median genome problem in its generality. We show that in real application cases the computational results are highly robust, suggesting that we can interpret the computed median genomes as candidates carrying the semantics of ancestral architectures.Read less <
English Keywords
Median Genome Problem
probabilistic neighborhood
local search
Origin
Hal imported