{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:48:01Z","timestamp":1742982481480,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319181660"},{"type":"electronic","value":"9783319181677"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18167-7_15","type":"book-chapter","created":{"date-parts":[[2015,5,7]],"date-time":"2015-05-07T04:27:19Z","timestamp":1430972839000},"page":"165-176","source":"Crossref","is-referenced-by-count":3,"title":["Approximate Counting with Deterministic Guarantees for Affinity Computation"],"prefix":"10.1007","author":[{"given":"Cl\u00e9ment","family":"Viricel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Simoncini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Allouche","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"de Givry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sophie","family":"Barbe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Schiex","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Fersht, A.: Structure and mechanism in protein science: a guide to enzyme catalysis and protein folding. W.H. Freeman and Co., New York (1999)"},{"issue":"12","key":"15_CR2","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1038\/nmeth1207-991","volume":"4","author":"S.G. Peisajovich","year":"2007","unstructured":"Peisajovich, S.G., Tawfik, D.S.: Protein engineers turned evolutionists. Nature Methods\u00a04(12), 991\u2013994 (2007)","journal-title":"Nature Methods"},{"issue":"5897","key":"15_CR3","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1038\/301200a0","volume":"301","author":"C. Pabo","year":"1983","unstructured":"Pabo, C.: Molecular technology. Designing proteins and peptides. Nature\u00a0301(5897), 200 (1983)","journal-title":"Nature"},{"issue":"4","key":"15_CR4","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/j.chembiol.2012.01.018","volume":"19","author":"A.E. Miklos","year":"2012","unstructured":"Miklos, A.E., Kluwe, C., Der, B.S., Pai, S., Sircar, A., Hughes, R.A., Berrondo, M., Xu, J., Codrea, V., Buckley, P.E., et al.: Structure-based design of supercharged, highly thermoresistant antibodies. Chemistry & Biology\u00a019(4), 449\u2013455 (2012)","journal-title":"Chemistry & Biology"},{"issue":"5989","key":"15_CR5","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1126\/science.1190239","volume":"329","author":"J.B. Siegel","year":"2010","unstructured":"Siegel, J.B., Zanghellini, A., Lovick, H.M., Kiss, G., Lambert, A.R., St Clair, J.L., Gallaher, J.L., Hilvert, D., Gelb, M.H., Stoddard, B.L., Houk, K.N., Michael, F.E., Baker, D.: Computational design of an enzyme catalyst for a stereoselective bimolecular Diels-Alder reaction. Science\u00a0329(5989), 309\u2013313 (2010)","journal-title":"Science"},{"issue":"10","key":"15_CR6","doi-asserted-by":"publisher","first-page":"1527","DOI":"10.1002\/jcc.20909","volume":"29","author":"I. Georgiev","year":"2008","unstructured":"Georgiev, I., Lilien, R.H., Donald, B.R.: The minimized dead-end elimination criterion and its application to protein redesign in a hybrid scoring and search algorithm for computing partition functions over molecular ensembles. Journal of Computational Chemistry\u00a029(10), 1527\u20131542 (2008)","journal-title":"Journal of Computational Chemistry"},{"key":"15_CR7","unstructured":"Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming. Elsevier (2006)"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/j.artint.2010.02.001","volume":"174","author":"M. Cooper","year":"2010","unstructured":"Cooper, M., de Givry, S., Sanchez, M., Schiex, T., Zytnicki, M., Werner, T.: Soft arc consistency revisited. Artificial Intelligence\u00a0174, 449\u2013478 (2010)","journal-title":"Artificial Intelligence"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/3-540-45349-0_22","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"J. Larrosa","year":"2000","unstructured":"Larrosa, J.: Boosting search with variable elimination. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 291\u2013305. Springer, Heidelberg (2000)"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Gainza, P., Roberts, K.E., Georgiev, I., Lilien, R.H., Keedy, D.A., Chen, C.Y., Reza, F., Anderson, A.C., Richardson, D.C., Richardson, J.S., et al.: Osprey: Protein design with ensembles, flexibility, and provable algorithms. Methods Enzymol. (2012)","DOI":"10.1016\/B978-0-12-394292-0.00005-9"},{"issue":"6369","key":"15_CR11","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1038\/356539a0","volume":"356","author":"J. Desmet","year":"1992","unstructured":"Desmet, J., De Maeyer, M., Hazes, B., Lasters, I.: The dead-end elimination theorem and its use in protein side-chain positioning. Nature\u00a0356(6369), 539\u2013542 (1992)","journal-title":"Nature"},{"issue":"10","key":"15_CR12","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1093\/protein\/15.10.779","volume":"15","author":"N.A. Pierce","year":"2002","unstructured":"Pierce, N.A., Winfree, E.: Protein design is NP-hard. Protein Engineering\u00a015(10), 779\u2013782 (2002)","journal-title":"Protein Engineering"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Rubinstein, R.Y., Ridder, A., Vaisman, R.: Fast sequential Monte Carlo methods for counting and optimization. John Wiley & Sons (2013)","DOI":"10.1002\/9781118612323"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.artint.2014.03.005","volume":"212","author":"D. Allouche","year":"2014","unstructured":"Allouche, D., Andr\u00e9, I., Barbe, S., Davies, J., de Givry, S., Katsirelos, G., O\u2019Sullivan, B., Prestwich, S., Schiex, T., Traor\u00e9, S.: Computational protein design as an optimization problem. Artificial Intelligence\u00a0212, 59\u201379 (2014)","journal-title":"Artificial Intelligence"},{"issue":"2","key":"15_CR15","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10107-008-0235-8","volume":"121","author":"F. Rendl","year":"2010","unstructured":"Rendl, F., Rinaldi, G., Wiegele, A.: Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations. Math. Programming\u00a0121(2), 307 (2010)","journal-title":"Math. Programming"},{"issue":"17","key":"15_CR16","doi-asserted-by":"publisher","first-page":"2129","DOI":"10.1093\/bioinformatics\/btt374","volume":"29","author":"S. Traor\u00e9","year":"2013","unstructured":"Traor\u00e9, S., Allouche, D., Andr\u00e9, I., de Givry, S., Katsirelos, G., Schiex, T., Barbe, S.: A new framework for computational protein design through cost function network optimization. Bioinformatics\u00a029(17), 2129\u20132136 (2013)","journal-title":"Bioinformatics"},{"key":"15_CR17","unstructured":"Case, D., Babin, V., Berryman, J., Betz, R., Cai, Q., Cerutti, D., Cheatham Iii, T., Darden, T., Duke, R., Gohlke, H., et al.: Amber 14 (2014)"},{"issue":"3","key":"15_CR18","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1002\/1097-0134(20000815)40:3<389::AID-PROT50>3.0.CO;2-2","volume":"40","author":"S.C. Lovell","year":"2000","unstructured":"Lovell, S.C., Word, J.M., Richardson, J.S., Richardson, D.C.: The penultimate rotamer library. Proteins\u00a040(3), 389\u2013408 (2000)","journal-title":"Proteins"},{"key":"15_CR19","unstructured":"Larrosa, J., de Givry, S., Heras, F., Zytnicki, M.: Existential arc consistency: getting closer to full arc consistency in weighted CSPs. In: Proc. of the 19th IJCAI, Edinburgh, Scotland, pp. 84\u201389 (August 2005)"},{"key":"15_CR20","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: ECAI, vol.\u00a016, p. 146 (2004)"},{"key":"15_CR21","doi-asserted-by":"publisher","first-page":"1592","DOI":"10.1016\/j.artint.2009.09.002","volume":"173","author":"C. Lecoutre","year":"2009","unstructured":"Lecoutre, C., Sa\u00efs, L., Tabary, S., Vidal, V.: Reasoning from last conflict(s) in constraint programming. Artificial Intelligence\u00a0173, 1592\u20131614 (2009)","journal-title":"Artificial Intelligence"},{"issue":"6","key":"15_CR22","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1016\/j.str.2011.03.019","volume":"19","author":"M.V. Shapovalov","year":"2011","unstructured":"Shapovalov, M.V., Dunbrack, R.L.: A smoothed backbone-dependent rotamer library for proteins derived from adaptive kernel density estimates and regressions. Structure\u00a019(6), 844\u2013858 (2011)","journal-title":"Structure"},{"issue":"11","key":"15_CR23","doi-asserted-by":"publisher","first-page":"3177","DOI":"10.1002\/prot.24685","volume":"82","author":"S. Subramaniam","year":"2014","unstructured":"Subramaniam, S., Senes, A.: Backbone dependency further improves side chain prediction efficiency in the energy-based conformer library (bebl). Proteins: Structure, Function, and Bioinformatics\u00a082(11), 3177\u20133187 (2014)","journal-title":"Proteins: Structure, Function, and Bioinformatics"},{"key":"15_CR24","unstructured":"Sang, T., Bacchus, F., Beame, P., Kautz, H., Pitassi, T.: Combining component caching and clause learning for effective model counting. In: Proc. of the 7th Int. Conf. on Theory and Applications of Satisfiability Testing (SAT 2004) (2004)"},{"key":"15_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-642-39091-3_11","volume-title":"Symbolic and Quantitative Approaches to Reasoning with Uncertainty","author":"A. Choi","year":"2013","unstructured":"Choi, A., Kisa, D., Darwiche, A.: Compiling probabilistic graphical models using sentential decision diagrams. In: van der Gaag, L.C. (ed.) ECSQARU 2013. LNCS, vol.\u00a07958, pp. 121\u2013132. Springer, Heidelberg (2013)"},{"key":"15_CR26","unstructured":"Larrosa, J., Heras, F.: Resolution in max-sat and its relation to local consistency in weighted csps. In: IJCAI, pp. 193\u2013198 (2005)"}],"container-title":["Advances in Intelligent Systems and Computing","Modelling, Computation and Optimization in Information Systems and Management Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18167-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T05:20:47Z","timestamp":1676956847000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18167-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319181660","9783319181677"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18167-7_15","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015]]}}}