par Catanzaro, Daniele 
;Labbé, Martine ;Halldórsson, Bjarni B.V.
Référence IEEE/ACM transactions on computational biology and bioinformatics, 10, 6, page (1391-1402), 6357183
Publication Publié, 2013-11
;Labbé, Martine ;Halldórsson, Bjarni B.V.Référence IEEE/ACM transactions on computational biology and bioinformatics, 10, 6, page (1391-1402), 6357183
Publication Publié, 2013-11
Article révisé par les pairs
| Résumé : | A loss of heterozygosity (LOH) event occurs when, by the laws of Mendelian inheritance, an individual should be heterozygote at a given site but, due to a deletion polymorphism, is not. Deletions play an important role in human disease and their detection could provide fundamental insights for the development of new diagnostics and treatments. In this paper, we investigate the parsimonious loss of heterozygosity problem (PLOHP), i.e., the problem of partitioning suspected polymorphisms from a set of individuals into a minimum number of deletion areas. Specifically, we generalize Halldórsson et al.'s work by providing a more general formulation of the PLOHP and by showing how one can incorporate different recombination rates and prior knowledge about the locations of deletions. Moreover, we show that the PLOHP can be formulated as a specific version of the clique partition problem in a particular class of graphs called undirected catch-point interval graphs and we prove its general NP-hardness. Finally, we provide a state-of-the-art integer programming (IP) formulation and strengthening valid inequalities to exactly solve real instances of the PLOHP containing up to 9,000 individuals and 3,000 SNPs. Our results give perspectives on the mathematics of the PLOHP and suggest new directions on the development of future efficient exact solution approaches. © 2013 IEEE. |
