- author = "Robin Nunkesser",
- title = "Analysis of a genetic programming algorithm for association studies",
- booktitle = "GECCO '08: Proceedings of the 10th annual conference on Genetic and evolutionary computation",
- year = "2008",
- editor = "Maarten Keijzer and Giuliano Antoniol and Clare Bates Congdon and Kalyanmoy Deb and Benjamin Doerr and Nikolaus Hansen and John H. Holmes and Gregory S. Hornby and Daniel Howard and James Kennedy and Sanjeev Kumar and Fernando G. Lobo and Julian Francis Miller and Jason Moore and Frank Neumann and Martin Pelikan and Jordan Pollack and Kumara Sastry and Kenneth Stanley and Adrian Stoica and El-Ghazali Talbi and Ingo Wegener",
- pages = "1259--1266",
- address = "Atlanta, GA, USA",
- publisher = "ACM",
- publisher_address = "New York, NY, USA",
- month = "12-16 " # jul,
- keywords = "genetic algorithms, genetic programming, association studies, logic minimisation",
- isbn13 = "978-1-60558-130-9",
-
URL = "
http://gpbib.cs.ucl.ac.uk/gecco2008/docs/p1259.pdf",
-
DOI = "
doi:10.1145/1389095.1389339",
- size = "8 pages",
- abstract = "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.",
-
notes = "GECCO-2008 A joint meeting of the seventeenth
international conference on genetic algorithms
(ICGA-2008) and the thirteenth annual genetic
programming conference (GP-2008).
ACM Order Number 910081. Also known as \cite{1389339}",
