{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:32Z","timestamp":1725488972145},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540699941"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69995-8_14","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T12:28:21Z","timestamp":1186748901000},"page":"83-95","source":"Crossref","is-referenced-by-count":3,"title":["Integer Quadratic Programming Models in Computational Biology"],"prefix":"10.1007","author":[{"given":"Harvey J.","family":"Greenberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"14_CR1","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.disopt.2004.03.006","volume":"1","author":"W.P. Adams","year":"2004","unstructured":"W.P. Adams, R.J. Forrester, and F. Glover. Comparisons and enhancement strategies for linearizing mixed 0\u20131 quadratic programs. Discrete Optimization, 1(2):99\u2013120, 2004.","journal-title":"Discrete Optimization"},{"issue":"3\u20134","key":"14_CR2","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1023\/A:1020533821509","volume":"7","author":"R. Backofen","year":"2002","unstructured":"R. Backofen and S. Will. Excluding symmetries in constraint-based search. Constraints, 7(3\u20134):333\u2013349, 2002.","journal-title":"Constraints"},{"key":"14_CR3","series-title":"Technical Report","volume-title":"Convex quadratic programming for exact solution of 0\u20131 quadratic programs","author":"S. Billionnet","year":"2005","unstructured":"S. Billionnet, S. Elloumi, and M-C. Plateau. Convex quadratic programming for exact solution of 0\u20131 quadratic programs. Technical Report 856, Laboratoire CEDRIC, Institut d\u2019Informatique d\u2019Entreprise, Paris, FR, 2005."},{"issue":"3","key":"14_CR4","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1016\/j.ejor.2003.10.054","volume":"161","author":"J. Bla\u017cewicz","year":"2005","unstructured":"J. Bla\u017cewicz, P. Formanowicz, and M. Kasprzak. Selected combinatorial problems of computational biology. European Journal of Operational Research, 161(3):585\u2013597, 2005.","journal-title":"European Journal of Operational Research"},{"key":"14_CR5","volume-title":"The Delphic Boat","author":"A. Danchin","year":"2002","unstructured":"A. Danchin. The Delphic Boat. Harvard University Press, Cambridge, MA, 2002."},{"issue":"2","key":"14_CR6","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1002\/jcc.10121","volume":"24","author":"D.B. Gordon","year":"2003","unstructured":"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\u2013243, 2003.","journal-title":"Journal of Computational Chemistry"},{"issue":"3","key":"14_CR7","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1287\/ijoc.1040.0073","volume":"16","author":"H.J. Greenberg","year":"2004","unstructured":"H.J. Greenberg, W.E. Hart, and G. Lancia. Opportunities for combinatorial optimization in computational biology. INFORMS Journal on Computing, 16(3):211\u2013231, 2004.","journal-title":"INFORMS Journal on Computing"},{"key":"14_CR8","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1051\/ro\/197004V300671","volume":"4","author":"P.L. Hammer","year":"1970","unstructured":"P.L. Hammer and A.A. Rubin. Some remarks on quadratic programming with 0\u20131 variables. R.I.R.O., 4:67\u201379, 1970.","journal-title":"R.I.R.O."},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"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\u2013168, New York, NY, 1995. ACM Special Interest Group on Algorithms and Computation Theory.","DOI":"10.1145\/225058.225106"},{"key":"14_CR10","unstructured":"A. Holder, editor. Mathematical Programming Glossary. INFORMS Computing Society, http:\/\/glossary.computing.society.informs.org, 2006."},{"issue":"7","key":"14_CR11","doi-asserted-by":"publisher","first-page":"1028","DOI":"10.1093\/bioinformatics\/bti144","volume":"21","author":"C.L. Kingsford","year":"2005","unstructured":"C.L. Kingsford, B. Chazelle, and M. Singh. Solving and analyzing side-chain positioning problems using linear and integer programming. Bioinformatics, 21(7):1028\u20131036, 2005.","journal-title":"Bioinformatics"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"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\u2013202, New York, NY, 2001.","DOI":"10.1145\/369133.369199"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1016\/0022-2836(70)90057-4","volume":"48","author":"S.B. Needleman","year":"1970","unstructured":"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\u2013453, 1970.","journal-title":"Journal of Molecular Biology"},{"issue":"4922","key":"14_CR14","doi-asserted-by":"publisher","first-page":"1066","DOI":"10.1126\/science.2475911","volume":"245","author":"J.R. Riordan","year":"1989","unstructured":"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\u20131073, 1989.","journal-title":"Science"},{"issue":"3","key":"14_CR15","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/S0022-5193(84)80037-5","volume":"108","author":"M.S. Waterman","year":"1984","unstructured":"M.S. Waterman. Efficient sequence alignment algorithms. Journal of Theoretical Biology, 108(3):333\u2013337, 1984.","journal-title":"Journal of Theoretical Biology"},{"issue":"2","key":"14_CR16","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1093\/bioinformatics\/bti763","volume":"22","author":"W. Xie","year":"2006","unstructured":"W. Xie and N.V. Sahinidis. Residue-rotamer-reduction algorithm for the protein side-chain conformation problem. Bioinformatics, 22(2):188\u2013194, 2006.","journal-title":"Bioinformatics"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2006"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69995-8_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:06:05Z","timestamp":1605744365000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69995-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540699941"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69995-8_14","relation":{},"subject":[]}}