{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T23:56:54Z","timestamp":1794527814982,"version":"4.9.1"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319449524","type":"print"},{"value":"9783319449531","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44953-1_46","type":"book-chapter","created":{"date-parts":[[2016,8,22]],"date-time":"2016-08-22T11:12:23Z","timestamp":1471864343000},"page":"733-750","source":"Crossref","is-referenced-by-count":11,"title":["Guaranteed Weighted Counting for Affinity Computation: Beyond Determinism and Structure"],"prefix":"10.1007","author":[{"given":"Cl\u00e9ment","family":"Viricel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Simoncini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sophie","family":"Barbe","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Schiex","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,8,23]]},"reference":[{"key":"46_CR1","doi-asserted-by":"crossref","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. Artif. Intell. 212, 59\u201379 (2014)","journal-title":"Artif. Intell."},{"key":"46_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1007\/978-3-319-23219-5_2","volume-title":"Principles and Practice of Constraint Programming","author":"D Allouche","year":"2015","unstructured":"Allouche, D., de Givry, S., Katsirelos, G., Schiex, T., Zytnicki, M.: Anytime hybrid best-first search with tree decomposition for weighted CSP. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 12\u201329. Springer, Heidelberg (2015)"},{"key":"46_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/978-3-540-74970-7_12","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"F Bacchus","year":"2007","unstructured":"Bacchus, F.: GAC via unit propagation. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 133\u2013147. Springer, Heidelberg (2007)"},{"issue":"8","key":"46_CR4","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1016\/j.artint.2007.03.001","volume":"171","author":"ML Bonet","year":"2007","unstructured":"Bonet, M.L., Levy, J., Many\u00e0, F.: Resolution for max-sat. Artif. Intell. 171(8), 606\u2013618 (2007)","journal-title":"Artif. Intell."},{"key":"46_CR5","doi-asserted-by":"crossref","first-page":"953","DOI":"10.1613\/jair.4193","volume":"48","author":"F Campeotto","year":"2013","unstructured":"Campeotto, F., Dal Palu, A., Dovier, A., Fioretto, F., Pontelli, E.: A constraint solver for flexible protein model. J. Artif. Intell. Res. 48, 953\u20131000 (2013)","journal-title":"J. Artif. Intell. Res."},{"key":"46_CR6","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)"},{"key":"46_CR7","doi-asserted-by":"crossref","unstructured":"Chakraborty, S., Fremont, D.J., Meel, K.S., Seshia, S.A., Vardi, M.Y.: Distribution-aware sampling and weighted model counting for SAT. In: Proceedings of the 28th Conference on Artificial Intelligence, pp. 1722\u20131730 (2014)","DOI":"10.1609\/aaai.v28i1.8990"},{"issue":"6","key":"46_CR8","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1016\/j.artint.2007.11.002","volume":"172","author":"M Chavira","year":"2008","unstructured":"Chavira, M., Darwiche, A.: On probabilistic inference by weighted model counting. Artif. Intell. 172(6), 772\u2013799 (2008)","journal-title":"Artif. Intell."},{"key":"46_CR9","doi-asserted-by":"crossref","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. Artif. Intell. 174, 449\u2013478 (2010)","journal-title":"Artif. Intell."},{"key":"46_CR10","unstructured":"Darwiche, A.: A logical approach to factoring belief networks. In: KR 2002, pp. 409\u2013420 (2002)"},{"issue":"1\u20132","key":"46_CR11","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0004-3702(99)00059-4","volume":"113","author":"R Dechter","year":"1999","unstructured":"Dechter, R.: Bucket elimination: a unifying framework for reasoning. Artif. Intell. 113(1\u20132), 41\u201385 (1999)","journal-title":"Artif. Intell."},{"issue":"3","key":"46_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2200\/S00529ED1V01Y201308AIM023","volume":"7","author":"R Dechter","year":"2013","unstructured":"Dechter, R.: Reasoning with probabilistic and deterministic graphical models: Exact algorithms. Synth. Lect. Artif. Intell. Mach. Learn. 7(3), 1\u2013191 (2013)","journal-title":"Synth. Lect. Artif. Intell. Mach. Learn."},{"key":"46_CR13","unstructured":"Dechter, R., Flerova, N., Marinescu, R.: Search algorithms for m best solutions for graphical models. In: AAAI. Citeseer (2012)"},{"key":"46_CR14","unstructured":"Ermon, S., Gomes, C.P., Sabharwal, A., Selman, B.: Taming the curse of dimensionality: Discrete integration by hashing and optimization. arXiv preprint arXiv:1302.6677 (2013)"},{"issue":"10","key":"46_CR15","doi-asserted-by":"crossref","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. J. Comput. Chem. 29(10), 1527\u20131542 (2008)","journal-title":"J. Comput. Chem."},{"key":"46_CR16","doi-asserted-by":"crossref","unstructured":"Gilks, W.R.: Markov Chain Monte Carlo. Wiley Online Library (2005)","DOI":"10.1002\/0470011815.b2a14021"},{"key":"46_CR17","doi-asserted-by":"crossref","unstructured":"Jaakkola, T.S.: Tutorial on variational approximation methods. In: Advanced Mean Field Methods: Theory Practice, p. 129 (2001)","DOI":"10.7551\/mitpress\/1100.003.0014"},{"issue":"4","key":"46_CR18","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1016\/j.sbi.2009.07.005","volume":"19","author":"J Karanicolas","year":"2009","unstructured":"Karanicolas, J., Kuhlman, B.: Computational design of affinity and specificity at protein-protein interfaces. Curr. Opin. Struct. Biol. 19(4), 458\u2013463 (2009)","journal-title":"Curr. Opin. Struct. Biol."},{"issue":"7503","key":"46_CR19","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1038\/nature13404","volume":"510","author":"NP King","year":"2014","unstructured":"King, N.P., Bale, J.B., Sheffler, W., McNamara, D.E., Gonen, S., Gonen, T., Yeates, T.O., Baker, D.: Accurate design of co-assembling multi-component protein nanomaterials. Nature 510(7503), 103\u2013108 (2014)","journal-title":"Nature"},{"issue":"4","key":"46_CR20","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","volume":"6","author":"DE Knuth","year":"1976","unstructured":"Knuth, D.E., Moore, R.W.: An analysis of alpha-beta pruning. Artif. Intell. 6(4), 293\u2013326 (1976)","journal-title":"Artif. Intell."},{"key":"46_CR21","unstructured":"Koster, A.: Frequency assignment: Models and Algorithms. Ph.D. thesis, University of Maastricht, The Netherlands (1999). www.zib.de\/koster\/thesis.html"},{"key":"46_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 1894, pp. 291\u2013305. Springer, Heidelberg (2000)"},{"key":"46_CR23","unstructured":"Larrosa, J., Heras, F.: Resolution in Max-SAT and its relation to local consistency in weighted CSPs. In: Proceedings of the 19th IJCAI, Edinburgh, Scotland, pp. 193\u2013198 (2005)"},{"issue":"2\u20133","key":"46_CR24","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/j.artint.2007.05.006","volume":"172","author":"J Larrosa","year":"2008","unstructured":"Larrosa, J., Heras, F., de Givry, S.: A logical approach to efficient max-sat solving. Artif. Intell. 172(2\u20133), 204\u2013233 (2008)","journal-title":"Artif. Intell."},{"key":"46_CR25","unstructured":"Liu, Q., Ihler, A.T.: Bounding the partition function using holder\u2019s inequality. In: Proceedings of the 28th International Conference on Machine Learning (ICML 2011), pp. 849\u2013856 (2011)"},{"issue":"3","key":"46_CR26","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1002\/1097-0134(20000815)40:3<389::AID-PROT50>3.0.CO;2-2","volume":"40","author":"SC Lovell","year":"2000","unstructured":"Lovell, S.C., Word, J.M., Richardson, J.S., Richardson, D.C.: The penultimate rotamer library. Proteins 40(3), 389\u2013408 (2000). http:\/\/www.ncbi.nlm.nih.gov\/pubmed\/10861930","journal-title":"Proteins"},{"issue":"4","key":"46_CR27","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/j.chembiol.2012.01.018","volume":"19","author":"AE 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. Chem. Biol. 19(4), 449\u2013455 (2012)","journal-title":"Chem. Biol."},{"key":"46_CR28","unstructured":"Oztok, U., Darwiche, A.: A top-down compiler for sentential decision diagrams. In: Proceedings of the 24th International Conference on Artificial Intelligence. AAAI Press (2015)"},{"issue":"1","key":"46_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0010-4655(95)00041-D","volume":"91","author":"DA Pearlman","year":"1995","unstructured":"Pearlman, D.A., Case, D.A., Caldwell, J.W., Ross, W.S., Cheatham, T.E., DeBolt, S., Ferguson, D., Seibel, G., Kollman, P.: Amber, a package of computer programs for applying molecular mechanics, normal mode analysis, molecular dynamics and free energy calculations to simulate the structural and energetic properties of molecules. Comput. Phys. Commun. 91(1), 1\u201341 (1995)","journal-title":"Comput. Phys. Commun."},{"issue":"1","key":"46_CR30","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0004-3702(94)00092-1","volume":"82","author":"D Roth","year":"1996","unstructured":"Roth, D.: On the hardness of approximate reasoning. Artif. Intell. 82(1), 273\u2013302 (1996)","journal-title":"Artif. Intell."},{"issue":"7192","key":"46_CR31","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1038\/nature06879","volume":"453","author":"D R\u00f6thlisberger","year":"2008","unstructured":"R\u00f6thlisberger, D., Khersonsky, O., Wollacott, A.M., Jiang, L., DeChancie, J., Betker, J., Gallaher, J.L., Althoff, E.A., Zanghellini, A., Dym, O., Albeck, S., Houk, K.N., Tawfik, D.S., Baker, D.: Kemp elimination catalysts by computational enzyme design. Nature 453(7192), 190\u2013195 (2008). http:\/\/www.ncbi.nlm.nih.gov\/pubmed\/18354394","journal-title":"Nature"},{"issue":"4","key":"46_CR32","doi-asserted-by":"crossref","first-page":"1055","DOI":"10.1002\/prot.22631","volume":"78","author":"DW Sammond","year":"2010","unstructured":"Sammond, D.W., Eletr, Z.M., Purbeck, C., Kuhlman, B.: Computational design of second-site suppressor mutations at protein-protein interfaces. Prot. Struct. Funct. Bioinform. 78(4), 1055\u20131065 (2010)","journal-title":"Prot. Struct. Funct. Bioinform."},{"key":"46_CR33","unstructured":"Sang, T., Beame, P., Kautz, H.: Solving bayesian networks by weighted model counting. In: Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI 2005). vol. 1, pp. 475\u2013482 (2005)"},{"key":"46_CR34","first-page":"113","volume":"4","author":"M Schlesinger","year":"1976","unstructured":"Schlesinger, M.: Syntactic analysis of two-dimensional visual signals in noisy conditions. Kibernetika 4, 113\u2013130 (1976)","journal-title":"Kibernetika"},{"issue":"11","key":"46_CR35","doi-asserted-by":"crossref","first-page":"5098","DOI":"10.1021\/ct400383v","volume":"9","author":"NW Silver","year":"2013","unstructured":"Silver, N.W., King, B.M., Nalam, M.N., Cao, H., Ali, A., Kiran Kumar Reddy, G., Rana, T.M., Schiffer, C.A., Tidor, B.: Efficient computation of small-molecule configurational binding entropy and free energy changes by ensemble enumeration. J. Chem. Theory Comput. 9(11), 5098\u20135115 (2013)","journal-title":"J. Chem. Theory Comput."},{"issue":"12","key":"46_CR36","doi-asserted-by":"crossref","first-page":"5980","DOI":"10.1021\/acs.jctc.5b00594","volume":"11","author":"D Simoncini","year":"2015","unstructured":"Simoncini, D., Allouche, D., de Givry, S., Delmas, C., Barbe, S., Schiex, T.: Guaranteed discrete energy optimization on large protein design problems. J. Chem. Theory Comput. 11(12), 5980\u20135989 (2015)","journal-title":"J. Chem. Theory Comput."},{"key":"46_CR37","doi-asserted-by":"crossref","unstructured":"Toda, S.: On the computational power of PP and $$\\oplus $$ P. In: 30th Annual Symposium on Foundations of Computer Science, pp. 514\u2013519. IEEE (1989)","DOI":"10.1109\/SFCS.1989.63527"},{"issue":"2","key":"46_CR38","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of computing the permanent. Theoret. Comput. Sci. 8(2), 189\u2013201 (1979)","journal-title":"Theoret. Comput. Sci."},{"key":"46_CR39","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/978-3-319-18167-7_15","volume-title":"Modelling, Computation and Optimization in Information Systems and Management Sciences","author":"C Viricel","year":"2015","unstructured":"Viricel, C., Simoncini, D., Allouche, D., de Givry, S., Barbe, S., Schiex, T.: Approximate counting with deterministic guarantees for affinity computation. In: Le Thi, H.A., Dinh, T.P., Nguyen, N.T. (eds.) Model. Comput. & Optim. in Inf. Syst. & Manage. Sci. AISC, vol. 360, pp. 165\u2013176. Springer, Switzerland (2015)"},{"issue":"7","key":"46_CR40","doi-asserted-by":"crossref","first-page":"2313","DOI":"10.1109\/TIT.2005.850091","volume":"51","author":"MJ Wainwright","year":"2005","unstructured":"Wainwright, M.J., Jaakkola, T.S., Willsky, A.S.: A new class of upper bounds on the log partition function. IEEE Trans. Inf. Theory 51(7), 2313\u20132335 (2005)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44953-1_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,18]],"date-time":"2024-06-18T20:31:48Z","timestamp":1718742708000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44953-1_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319449524","9783319449531"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44953-1_46","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-319-44953-1","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}