Skip to main content
SpringerLink
Log in
Book cover

Operations Research Proceedings 2006 pp 83–95Cite as

Integer Quadratic Programming Models in Computational Biology

  • Conference paper

Part of the book series: Operations Research Proceedings ((ORP,volume 2006))

Abstract

This presentation has two purposes: (1) show operations researchers how they can apply quadratic binary programming to current problems in molecular biology, and (2) show formulations of some combinatorial optimization problems as integer programs. The former purpose is primary, and I wish to persuade researchers to enter this exciting frontier. The latter purpose is part of a work in progress.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W.P. Adams, R.J. Forrester, and F. Glover. Comparisons and enhancement strategies for linearizing mixed 0–1 quadratic programs. Discrete Optimization, 1(2):99–120, 2004.

    Article  Google Scholar 

  2. R. Backofen and S. Will. Excluding symmetries in constraint-based search. Constraints, 7(3–4):333–349, 2002.

    Article  Google Scholar 

  3. S. Billionnet, S. Elloumi, and M-C. Plateau. Convex quadratic programming for exact solution of 0–1 quadratic programs. Technical Report 856, Laboratoire CEDRIC, Institut d’Informatique d’Entreprise, Paris, FR, 2005.

    Google Scholar 

  4. J. Blażewicz, P. Formanowicz, and M. Kasprzak. Selected combinatorial problems of computational biology. European Journal of Operational Research, 161(3):585–597, 2005.

    Article  Google Scholar 

  5. A. Danchin. The Delphic Boat. Harvard University Press, Cambridge, MA, 2002.

    Google Scholar 

  6. D.B. Gordon, G.K. Hom, S.L. Mayo, and N.A. Pierce. Exact rotamer optimization for protein design. Journal of Computational Chemistry, 24(2):232–243, 2003.

    Article  Google Scholar 

  7. H.J. Greenberg, W.E. Hart, and G. Lancia. Opportunities for combinatorial optimization in computational biology. INFORMS Journal on Computing, 16(3):211–231, 2004.

    Article  Google Scholar 

  8. P.L. Hammer and A.A. Rubin. Some remarks on quadratic programming with 0–1 variables. R.I.R.O., 4:67–79, 1970.

    Google Scholar 

  9. W.E. Hart and S. Istrail. Fast protein folding in the hydrophobic-hydrophilic model within three-eights of optimal. In Proceedings of the twenty-seventh annual ACM symposium on Theory of computing (STOC), pages 157–168, New York, NY, 1995. ACM Special Interest Group on Algorithms and Computation Theory.

    Google Scholar 

  10. A. Holder, editor. Mathematical Programming Glossary. INFORMS Computing Society, http://glossary.computing.society.informs.org, 2006.

    Google Scholar 

  11. C.L. Kingsford, B. Chazelle, and M. Singh. Solving and analyzing side-chain positioning problems using linear and integer programming. Bioinformatics, 21(7):1028–1036, 2005.

    Article  Google Scholar 

  12. G. Lancia, R. Carr, B. Walenz, and S. Istrail. 101 optima1 PDB structure alignments: A branch-and-cut algorithm for the maximum contact map overlap problem. In Proceedings of the Fifth Annual International Conference on Computational Biology, pages 143–202, New York, NY, 2001.

    Google Scholar 

  13. S.B. Needleman and C.D. Wunch. A general method applicable to the search for similarities in the amino acid sequences of two proteins. Journal of Molecular Biology, 48:444–453, 1970.

    Article  Google Scholar 

  14. J.R. Riordan, J.M. Rommens, B. Kerem, N. Alon, R. Rozmahel, Z. Grzelczak, J. Zielenski, S. Lok, N. Plavsic, and J.L. Chou. Identification of the cystic fibrosis gene: cloning and characterization of complementary DNA. Science, 245(4922):1066–1073, 1989.

    Article  Google Scholar 

  15. M.S. Waterman. Efficient sequence alignment algorithms. Journal of Theoretical Biology, 108(3):333–337, 1984.

    Google Scholar 

  16. W. Xie and N.V. Sahinidis. Residue-rotamer-reduction algorithm for the protein side-chain conformation problem. Bioinformatics, 22(2):188–194, 2006.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, University of Colorado at Denver and Health Sciences Center, USA

    Harvey J. Greenberg

Authors
  1. Harvey J. Greenberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Wirtschaftstheorie und Operations Research, Universität Karlsruhe (TH), Kaiserstraße 12, 76131, Karlsruhe, Germany

    Karl-Heinz Waldmann  & Ulrike M. Stocker  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Greenberg, H.J. (2007). Integer Quadratic Programming Models in Computational Biology. In: Waldmann, KH., Stocker, U.M. (eds) Operations Research Proceedings 2006. Operations Research Proceedings, vol 2006. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69995-8_14

Download citation

Publish with us

Policies and ethics

Search

Navigation