Sciweavers

250 search results - page 4 / 50
» Improving genetic algorithm performance with intelligent map...
Sort
View
GECCO
2005
Springer
141views Optimization» more  GECCO 2005»
14 years 27 days ago
Behavior of finite population variable length genetic algorithms under random selection
In this work we provide empirical evidence that shows how a variable-length genetic algorithm (GA) can naturally evolve shorter average size populations. This reduction in chromos...
Hal Stringer, Annie S. Wu
RECOMB
2006
Springer
14 years 7 months ago
Inferring Gene Orders from Gene Maps Using the Breakpoint Distance
Abstract. Preliminary to most comparative genomics studies is the annotation of chromosomes as ordered sequences of genes. Unfortunately, different genetic mapping techniques usual...
Guillaume Blin, Eric Blais, Pierre Guillon, Mathie...
GECCO
2004
Springer
126views Optimization» more  GECCO 2004»
14 years 23 days ago
A Gene Based Adaptive Mutation Strategy for Genetic Algorithms
In this study, a new mechanism that adapts the mutation rate for each locus on the chromosomes, based on feedback obtained from the current population is proposed. Through tests us...
Sima Uyar, Sanem Sariel, Gülsen Eryigit
BMCBI
2011
13 years 2 months ago
Comparing genotyping algorithms for Illumina's Infinium whole-genome SNP BeadChips
Background: Illumina’s Infinium SNP BeadChips are extensively used in both small and large-scale genetic studies. A fundamental step in any analysis is the processing of raw all...
Matthew E. Ritchie, Ruijie Liu, Benilton Carvalho,...
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
13 years 11 months ago
A fast hybrid genetic algorithm for the quadratic assignment problem
Genetic algorithms (GAs) have recently become very popular by solving combinatorial optimization problems. In this paper, we propose an extension of the hybrid genetic algorithm f...
Alfonsas Misevicius