Skip to main content

A Mixed Integer Programming Model for the Parsimonious Loss of Heterozygosity Problem

  • Conference paper
Bioinformatics Research and Applications (ISBRA 2012)

Part of the book series: Lecture Notes in Computer Science ((LNBI,volume 7292))

Included in the following conference series:

  • 962 Accesses

Abstract

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 \(\mathcal{NP}\)-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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bandelt, H.J., Oosten, M., Rutten, J.H.G.C., Spieksma, F.C.R.: Lifting theorems and facet characterization for a class of clique partitioning inequalities. Operations Research Letters 24(5), 235–243 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  2. Cargill, M., et al.: Characterization of single-nucleotide polymorphisms in coding regions of human genes. Nature Genetics 22, 231–238 (1999)

    Article  Google Scholar 

  3. Catanzaro, D., Andrien, M., Labbé, M., Toungouz-Nevessignsky, M.: Computer-aided human leukocyte antigen association studies: A case study for psoriasis and severe alopecia areata. Human Immunology 71(8), 783–788 (2010)

    Article  Google Scholar 

  4. Chen, K., et al.: BreakDancer: an algorithm for high resolution mapping of genomic structural variation. Nature Methods 6, 677–681 (2009)

    Article  Google Scholar 

  5. Conrad, D.F., Andrews, T.D., Carter, N.P., Hurles, M.E., Pritchard, J.K.: A high-resolution survey of deletion polymorphism in the human genome. Nature Genetics 38, 75–81 (2006)

    Article  Google Scholar 

  6. Conrad, D.F., et al.: Origins and functional impact of copy number variation in the human genome. Nature (464), 704–712 (2009)

    Article  Google Scholar 

  7. The International HapMap Consortium, The international hapmap project. Nature  426(18), 789–796 (2003)

    Google Scholar 

  8. Corbel, J.A., et al.: PEMer: a computational framework with simulation-based error models: for inferring genome structaral variants from massive paired-end sequencing data. Genome Biology 38(10), R23 (2009)

    Article  Google Scholar 

  9. Corona, E., Raphael, B., Eskin, E.: Identification of Deletion Polymorphisms from Haplotypes. In: Speed, T., Huang, H. (eds.) RECOMB 2007. LNCS (LNBI), vol. 4453, pp. 354–365. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  10. Dion, G., Jost, V., Queyranne, M.: Clique partitioning of interval graphs with submodular costs on the cliques. RAIRO Operations Research 41, 275–287 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  11. Fishburn, P.C.: Interval orders and interval graphs: Study of partially ordered sets. John Wiley and Sons Inc., NY (1985)

    MATH  Google Scholar 

  12. Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-Completeness. Freeman, NY (2003)

    Google Scholar 

  13. Grötschel, M., Wakabayashi, Y.: Facets of the clique partitioning polytope. Mathematical Programming 47, 367–387 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  14. Halldórsson, B., Aguiar, D., Tarpine, R., Istrail, S.: The Clark phase-able sample size problem: Long-range phasing and loss of heterozygosity in GWAS. Journal of Computational Biology 18(3), 323–333 (2011)

    Article  MathSciNet  Google Scholar 

  15. Halushka, M.K., Fan, J.B., Bentley, K., Hsie, L., Shen, N., Weder, A., Cooper, R., Lipshutz, R., Chakravarti, A.: Patterns of single nucleotide polymorphisms in candidate genes of blood pressure homeostasis. Nature Genetics 22, 239–247 (1999)

    Article  Google Scholar 

  16. Hudson, R.R.: Generating samples under a Wright-Fisher neutral model of genetic variation. Bioinformatics 18, 337–338 (2002)

    Article  Google Scholar 

  17. Kong, A., et al.: Fine-scale recombination rate differences between sexes, populations and individuals. Nature 467, 1099–1103 (2010)

    Article  Google Scholar 

  18. Li, W.H., Sadler, L.A.: Low nucleotide diversity in man. Genetics 129, 513–523 (1991)

    Google Scholar 

  19. McCarroll, S.A., et al.: Integrated detection and population-genetic analysis of snps and copy number variation. Nature Genetics 40, 1166–1174 (2008)

    Article  Google Scholar 

  20. Oosten, M., Rutten, J.H.G.C., Spieksma, F.C.R.: The clique partitioning problem: Facets and patching facets. Networks 38(4), 209–226 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  21. Schrijver, A.: Combinatorial optimization: Polyhedra and efficiency. Springer, NY (2003)

    MATH  Google Scholar 

  22. Stefansson, H., et al.: Large recurrent microdeletions associated with schizophrenia. Nature 455, 232–236 (2008)

    Article  Google Scholar 

  23. Terwilliger, J., Weiss, K.: Linkage disquilibrium mapping of complex disease: Fantasy and reality? Current Opinions in Biotechnology 9, 579–594 (1998)

    Article  Google Scholar 

  24. The International HapMap Consortium, A second generation human haplotype map of over 3.1 million SNPs. Nature  449(18), 851–861 (2007)

    Google Scholar 

  25. Wang, D.G., et al.: Large-scale identification, mapping, and genotyping of single-nucleotide polymorphisms in the human genome. Science 280(5366), 1077–1082 (1998)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Catanzaro, D., Labbé, M., Halldórsson, B.V. (2012). A Mixed Integer Programming Model for the Parsimonious Loss of Heterozygosity Problem. In: Bleris, L., Măndoiu, I., Schwartz, R., Wang, J. (eds) Bioinformatics Research and Applications. ISBRA 2012. Lecture Notes in Computer Science(), vol 7292. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30191-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30191-9_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30190-2

  • Online ISBN: 978-3-642-30191-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics