Analysis of a genetic programming algorithm for association studies

Authors:
Robin Nunkesser
Affiliations:
TU Dortmund, Dortmund, Germany
Venue:
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Year:
2008

Citing 12
Cited 0

Genetic programming (videotape): the movie

Genetic programming (videotape): the movie
Bagging predictors

Machine Learning
Computational geometry: algorithms and applications

Computational geometry: algorithms and applications
Genetic programming: an introduction: on the automatic evolution of computer programs and its applications

Genetic programming: an introduction: on the automatic evolution of computer programs and its applications
Random Forests

Machine Learning
Logic Minimization Algorithms for VLSI Synthesis

Logic Minimization Algorithms for VLSI Synthesis
A multivalued switching algebra with Boolean properties

MVL '76 Proceedings of the sixth international symposium on Multiple-valued logic
The Relationship Between Multivalued Switching Algebra and Boolean Algebra Under Different Definitions of Complement

IEEE Transactions on Computers
Multiple-Valued Decomposition of Generalized Boolean Functions and the Complexity of Programmable Logic Arrays

IEEE Transactions on Computers
Detecting high-order interactions of single nucleotide polymorphisms using genetic programming

Bioinformatics
Finding small OBDDs for incompletely specified truth tables is hard

COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper a Genetic Programming algorithm for genetic association studies is reconsidered. It is shown, that the application field of the algorithm is not restricted to genetic association studies, but that the algorithm can also be applied to logic minimization problems. In the context of multi-valued logic minimization on incompletely specified truth tables it outperforms existing algorithms. In addition, the facilities of the algorithm in the original application field are complemented by new results and experiments. This includes answers to the open questions of how to automatically choose the best individual in the last population and whether crossover is necessary for the algorithm.