• Citer

A mixed integer programming model for the parsimonious loss of heterozygosity problem

par Catanzaro, Daniele ;Labbé, Martine ;Halldórsson, Bjarni B.V.
Référence Lecture notes in computer science, 7292 LNBI, page (24-35)
Publication Publié, 2012

Article révisé par les pairs

• Détails
• Contenu

Résumé :

We investigate the Parsimonious Loss of Heterozygosity Problem (PLOHP), i.e., the problem of partitioning suspected polymorphisms of a set of individuals into the minimum number of deletion areas. We generalize the work of Halldórsson et al.' by showing how one can incorporate prior knowledge about the location of deletion; we prove the general -hardness of the problem and we provide a state-of-the-art mixed integer programming formulation and a number of possible strengthening valid inequalities able to exactly solve practical instances of the PLHOP containing up to 9.000 individuals and 3000 SNPs within 12 hours compute time. © 2012 Springer-Verlag.