Discovering Haplotypes in Linkage Disequilibrium Mapping with an Adaptive Genetic Algorithm

  • Laetitia Jourdan
  • Clarisse Dhaenens
  • El-Ghazali Talbi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2611)


In this paper, we present an evolutionary approach to discover candidate haplotypes in a linkage disequilibrium study. This work takes place into the study of factors involved in multi-factorial diseases such as diabetes and obesity. A first study on the linkage disequilibrium problem structure led us to use a genetic algorithm to solve it. Due to the particular, but classical, evaluation function given by the biologists, we design our genetic algorithm with several populations. This model lead us to implement different cooperative operators such as mutation and crossover. Probabilities of application of those mechanisms are set adaptively. In order to introduce some diversity, we also implement a random immigrant strategy and to cover up the cost of the evaluation computation we parallelize it in a master / slave model. Different combinations of the presented mechanisms are tested on real data and compared in term of robustness and computation cost. We show that the most complete strategy is able to find the best solutions and is the most robust.


Genetic Algorithm Linkage Disequilibrium Mutation Operator Adaptive Mutation Linkage Disequilibrium Mapping 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bruce Alberts, Alexander Johnson, Julian Lewis, Martin Ra., Keith Roberts, and Peter Walter. Molecular Biology of the Cell. Garland Pub, 4 edition, March 2002.Google Scholar
  2. 2.
    L. Davis. Adapting operator probabilities in genetic algorithms. In J. D. Schaffer, editor, Third International Conference on Genetic Algorithms, pages 61–69. Morgan Kaufmann, 1989. San Mateo, CA.Google Scholar
  3. 3.
    P.C. Sham et D. Curtis. Monte carlo tests for associations between disease and alleles at hightly polymorphic loci. Annal Human Genetic, pages 97–105, 1995.Google Scholar
  4. 4.
    A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Mancbek, and V. Sunderam. PVM: Parallel Virtual Machine-A User’s Guide and Tutorial for Networked Parallel Computing,. MIT PRess, 1994.Google Scholar
  5. 5.
    Vermeersch Grégory. Algorithmes génétiques pour la bio-informatique. Master’s thesis, University of Lille 1, LIFL, 2001.Google Scholar
  6. 6.
    Francisco Herrera and Manuel Lozano. Adaptation of genetic algorithm parameters based on fuzzy logic controllers. In F. Herrera and J. L. Verdegay, editors, Genetic Algorithms and Soft Computing, pages 95–125. Physica-Verlag, Heidelberg, 1996.Google Scholar
  7. 7.
    T. P. Hong, H.S. Wang, and W.C. Chen. Simultaneosly applying multiple mutation operators in genetic algorithms. Journal of Heuristics, 6:439–455, 2000.zbMATHCrossRefGoogle Scholar
  8. 8.
    Bryant A. Julstrom. What have you done for me lately? adapting operator probabilities in a steady-state genetic algorithm. In L. J. Eshelman, editor, Proceedings of the sixth International Conference on Genetic Algorithms, pages 81–87. Morgan Kaufmann, 1995. San Francisco, CA.Google Scholar
  9. 9.
    Department of Energy. The human genome program of the U.S. URL:, 2002.
  10. 10.
    J.D. Terwilliger and J. Ott. Handbook of human genetic linkage. Johns Hopkins University Press, Baltimore, June 1994. ISBN: 0801848032.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Laetitia Jourdan
  • Clarisse Dhaenens
    • 1
  • El-Ghazali Talbi
    • 1
  1. 1.LIFLUniversité de Lille1Villeneuve d’Ascq CedexFrance

Personalised recommendations