Haplotype inference using a genetic algorithm

  • Authors:
  • Dongsheng Che;Haibao Tang;Yinglei Song

  • Affiliations:
  • Computer Science Department, East Stroudsburg University, East Stroudsburg, PA;Plant Genome Mapping Laboratory, University of Georgia, Athens, GA;Mathematics and Computer Science Department, University of Maryland Eastern Shore, Princess Anne, MD

  • Venue:
  • CIBCB'09 Proceedings of the 6th Annual IEEE conference on Computational Intelligence in Bioinformatics and Computational Biology
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

The haplotype inference problem is a computational task to infer haplotype pairs based on the phaseunknown genotypes, and is pivotal in the International Hapmap project. The haplotype inference problem is NP-hard, and exact algorithms become infeasible when the problem sizes are big. Genetic algorithms (GA) are commonly used to approximate optimal solutions for NP-hard problems within reasonable computation time. In this paper, we have proposed a simple genetic algorithm formulation for the haplotype inference problem based on the model of parsimony, which aims to resolve the existing genotypes using as few haplotypes as possible. We applied our GA in the real datasets of the human β2AR locus and APOE locus, and compared the solutions to the experimentally verified haplotypes; we have found that our approach of inferring haplotypes is very accurate. We believe that our GA is a potentially powerful method for robust haplotype inferences.