Sciweavers

29 search results - page 1 / 6
» Optimizing exact genetic linkage computations
Sort
View
RECOMB
2003
Springer
14 years 5 months ago
Optimizing exact genetic linkage computations
Genetic linkage analysis is a challenging application which requires Bayesian networks consisting of thousands of vertices. Consequently, computing the likelihood of data, which i...
Dan Geiger, Maáyan Fishelson
BMCBI
2006
117views more  BMCBI 2006»
13 years 4 months ago
The Cluster Variation Method for Efficient Linkage Analysis on Extended Pedigrees
Background: Computing exact multipoint LOD scores for extended pedigrees rapidly becomes infeasible as the number of markers and untyped individuals increase. When markers are exc...
Cornelis A. Albers, Martijn A. R. Leisink, Hilbert...
PPSN
1994
Springer
13 years 8 months ago
Convergence Models of Genetic Algorithm Selection Schemes
We discuss the use of normal distribution theory as a tool to model the convergence characteristics of di erent GA selection schemes. The models predict the proportion of optimal a...
Dirk Thierens, David E. Goldberg
GECCO
2008
Springer
103views Optimization» more  GECCO 2008»
13 years 5 months ago
Empirical investigations on parallel competent genetic algorithms
This paper empirically investigates parallel competent genetic algorithms (cGAs) [4]. cGAs, such as BOA [21], LINCGA [15], D5 -GA [28], can solve GA-difficult problems by automati...
Miwako Tsuji, Masaharu Munetomo, Kiyoshi Akama
GECCO
2007
Springer
164views Optimization» more  GECCO 2007»
13 years 11 months ago
Learning building block structure from crossover failure
In the classical binary genetic algorithm, although crossover within a building block (BB) does not always cause a decrease in fitness, any decrease in fitness results from the ...
Zhenhua Li, Erik D. Goodman