par Catanzaro, Daniele 
;Godi, Alessandra;Labbé, Martine
Référence INFORMS journal on computing, 22, 2, page (195-209)
Publication Publié, 2010-03
;Godi, Alessandra;Labbé, Martine Référence INFORMS journal on computing, 22, 2, page (195-209)
Publication Publié, 2010-03
Article révisé par les pairs
| Résumé : | Haplotyping estimation from aligned single nucleotide polymorphism fragments has attracted increasing attention in recent years because of its importance in the analysis of fine-scale genetic data. Its application fields range from mapping of complex disease genes to inferring population histories, passing through designing drugs, functional genomics, and pharmacogenetics. The literature proposes several criteria for haplotyping populations, each of them characterized by biological motivations. One of the most important haplotyping criteria is parsimony, which consists of finding the minimum number of haplotypes necessary to explain a given set of genotypes. Parsimonious haplotype estimation is an NP-hard problem for which the literature has proposed several integer programming (IP) models. Here, we describe a new polynomial-sized IP model based on the concept of class representatives, already used for the coloring problem. We propose valid inequalities to strengthen our model and show, through computational experiments, that our model outperforms the best IP models currently known in literature. © 2010 INFORMS. |
