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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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.
R. Backofen and S. Will. Excluding symmetries in constraint-based search. Constraints, 7(3–4):333–349, 2002.
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.
J. Blażewicz, P. Formanowicz, and M. Kasprzak. Selected combinatorial problems of computational biology. European Journal of Operational Research, 161(3):585–597, 2005.
A. Danchin. The Delphic Boat. Harvard University Press, Cambridge, MA, 2002.
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.
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.
P.L. Hammer and A.A. Rubin. Some remarks on quadratic programming with 0–1 variables. R.I.R.O., 4:67–79, 1970.
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.
A. Holder, editor. Mathematical Programming Glossary. INFORMS Computing Society, http://glossary.computing.society.informs.org, 2006.
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.
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.
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.
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.
M.S. Waterman. Efficient sequence alignment algorithms. Journal of Theoretical Biology, 108(3):333–337, 1984.
W. Xie and N.V. Sahinidis. Residue-rotamer-reduction algorithm for the protein side-chain conformation problem. Bioinformatics, 22(2):188–194, 2006.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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
DOI: https://doi.org/10.1007/978-3-540-69995-8_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69994-1
Online ISBN: 978-3-540-69995-8
eBook Packages: Business and EconomicsBusiness and Management (R0)