Haplotyping as perfect phylogeny: conceptual framework and efficient solutions
Proceedings of the sixth annual international conference on Computational biology
A Survey of Optimization by Building and Using Probabilistic Models
Computational Optimization and Applications
Islands of Tractability for Parsimony Haplotyping
CSB '05 Proceedings of the 2005 IEEE Computational Systems Bioinformatics Conference
Insights on haplotype inference on large genotype datasets
BSB'10 Proceedings of the Advances in bioinformatics and computational biology, and 5th Brazilian conference on Bioinformatics
Hi-index | 0.00 |
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.