D. Allouche, Computational protein design as an optimization problem, Artificial Intelligence, vol.212, pp.59-79, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01268554

O. Alvizo, L. Stephen, and . Mayo, Evaluating and optimizing computational protein design force fields using fixed composition-based negative design, Proc. Natl. Acad. Sci. U.S.A. 105, vol.34, pp.12242-12247, 2008.

C. Anfinsen, Principles that govern the folding of protein chains, Science 181, vol.4096, pp.223-253, 1973.

U. Bertelé and F. Brioshi, Nonserial Dynamic Programming, 1972.

E. Boros and P. Hammer, Pseudo-Boolean Optimization, Discrete Appl. Math, vol.123, pp.155-225, 2002.
URL : https://hal.archives-ouvertes.fr/hal-01150533

F. Boussemart, Boosting systematic search by weighting constraints, vol.16, p.146, 2004.

M. Chavira and A. Darwiche, On probabilistic inference by weighted model counting, Artificial Intelligence, vol.172, pp.772-799, 2008.

M. C. Cooper and T. Schiex, Arc consistency for soft constraints, Artificial Intelligence, vol.154, issue.1-2, pp.199-227, 2004.

C. Martin and . Cooper, Virtual Arc Consistency for Weighted CSP, In: AAAI, vol.8, pp.253-258, 2008.

M. Cooper, Soft arc consistency revisited, Artificial Intelligence, vol.174, pp.449-478, 2010.
URL : https://hal.archives-ouvertes.fr/hal-02662237

R. Dechter and R. Mateescu, AND/OR search spaces for graphical models, Artificial intelligence, vol.171, issue.2-3, pp.73-106, 2007.

L. Roland and . Dunbrack, Rotamer Libraries in the 21 st Century, Current opinion in structural biology, vol.12, pp.431-440, 2002.

E. C. Freuder, Eliminating Interchangeable Values in Constraint Satisfaction Problems, Proc. of AAAI'91, pp.227-233, 1991.

P. Gainza, OSPREY: Protein design with ensembles, flexibility, and provable algorithms, Methods Enzymol, vol.523, pp.87-107, 2012.

I. Georgiev, H. Ryan, B. Lilien, and . Donald, 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, vol.29, issue.10, 2008.

S. De-givry, T. Schiex, and G. Verfaillie, Exploiting Tree Decomposition and Soft Local Consistency in Weighted CSP, Proc. of the National Conference on Artificial Intelligence, AAAI, pp.22-27, 2006.
URL : https://hal.archives-ouvertes.fr/hal-02755023

R. Goldstein, Efficient rotamer elimination applied to protein side-chains and related spin glasses, Biophysical journal, vol.66, issue.5, pp.6-3495, 1994.

J. D. Mark-a-hallen, B. Jou, and . Donald, LUTE (Local Unpruned Tuple Expansion): Accurate Continuously Flexible Protein Design with General Energy Functions and Rigid-rotamer-like Efficiency, Research in Computational Molecular Biology, pp.122-136, 2016.

. Mark-a-hallen, A. Daniel, B. Keedy, and . Donald, Dead-end elimination with perturbations (DEEPer): A provable protein design algorithm with continuous sidechain and backbone flexibility, Proteins, vol.81, pp.18-39, 2013.

L. Peter, P. Hammer, B. Hansen, and . Simeone, Roof duality, complementation and persistency in quadratic 0-1 optimization, Mathematical programming, vol.28, pp.121-155, 1984.

W. D. Harvey and M. L. Ginsberg, Limited Discrepency Search, Proc. of the 14 th IJCAI, 1995.

P. Jégou and C. Terrioux, Hybrid backtracking bounded by tree-decomposition of constraint networks, Artificial Intelligence, vol.146, pp.43-75, 2003.

J. Kappes, A comparative study of modern inference techniques for discrete energy minimization problems, Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp.1328-1335, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01247122

V. Kolmogorov, A new look at reweighted message passing, Pattern Analysis and Machine Intelligence, vol.37, pp.919-930, 2015.

V. Kolmogorov, Convergent tree-reweighted message passing for energy minimization, IEEE transactions on pattern analysis and machine intelligence, vol.28, pp.1568-1583, 2006.

V. Kolmogorov, Convergent tree-reweighted message passing for energy minimization, Pattern Analysis and Machine Intelligence, vol.28, pp.1568-1583, 2006.

A. Koster, Frequency assignment: Models and Algorithms, 1999.

&. Vk-koval and M. Schlesinger, Two-dimensional programming in image analysis problems, Avtomatika i Telemekhanika, vol.8, pp.149-168, 1976.

. Va-kovalevsky, A diffusion algorithm for decreasing energy of max-sum labeling problem, Glushkov Institute of Cybernetics, 1975.

J. Larrosa, Boosting search with variable elimination, Principles and Practice of Constraint Programming -CP 2000, vol.1894, pp.291-305, 2000.

J. Larrosa and T. Schiex, In the quest of the best form of local consistency for Weighted CSP, Proc. of the 18 th IJCAI, pp.239-244, 2003.

J. Larrosa, Existential arc consistency: getting closer to full arc consistency in weighted CSPs, Proc. of the 19 th IJCAI, pp.84-89, 2005.
URL : https://hal.archives-ouvertes.fr/hal-02762983

A. Leaver-fay, Scientific benchmarks for guiding macromolecular energy function improvement, Methods Enzymol, vol.523, p.109, 2013.

C. Lecoutre, O. Roussel, and . Dehani, WCSP integration of soft neighborhood substitutability, Principles and Practice of Constraint Programming, pp.406-421, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00866333

H. L-l-looger and . Hellinga, Generalized dead-end elimination algorithms make large-scale protein side-chain structure prediction tractable: implications for protein design and structural genomics, Journal of molecular biology, vol.307, pp.429-474, 2001.

S. Loudni and P. Boizumault, Solving constraint optimization problems in anytime contexts, Proc. of IJCAI, pp.251-256, 2003.

S. Lovell, The penultimate rotamer library, Proteins, vol.40, issue.3, pp.887-3585, 2000.

C. Negron and A. E. Keating, Multistate protein design using CLEVER and CLASSY, Methods Enzymol, vol.523, pp.171-190, 2013.

B. Neveu, G. Trombettoni, and F. Glover, Id walk: A candidate list strategy with a simple diversification device, Principles and Practice of Constraint Programming-CP 2004, pp.423-437, 2004.

A. Adegoke and . Ojewole, BBK?*(Branch and Bound over K?*): A Provable and Efficient Ensemble-Based Algorithm to Optimize Stability and Binding Affinity over Large Sequence Spaces, International Conference on Research in Computational Molecular Biology, pp.157-172, 2017.

A. Ouali, Iterative Decomposition Guided Variable Neighborhood Search for Graphical Model Energy Minimization, Proc. of the 33 rd Conference on Uncertainty in Artificial Intelligence. Ed. by Association for Uncertainty in Artificial Intelligence, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01628162

U. Oztok and A. Darwiche, A top-down compiler for sentential decision diagrams, Proceedings of the 24th International Conference on Artificial Intelligence, 2015.

N. Pierce, Conformational splitting: A more powerful criterion for dead-end elimination, Journal of computational chemistry, vol.21, pp.999-1009, 2000.

N. Pokala, M. Tracy, and . Handel, Energy functions for protein design: adjustment with protein-protein complex affinities, models for the unfolded state, and negative design of solubility and specificity, Journal of molecular biology, vol.347, pp.203-227, 2005.

C. Pralet, T. Verfaillie, and . Schiex, An algebraic graphical model for decision with uncertainties, feasibilities, and utilities, Journal of Artificial Intelligence Research, vol.29, pp.421-489, 2007.

D. Prusa and T. Werner, Universality of the local marginal polytope, Pattern Analysis and Machine Intelligence, vol.37, pp.898-904, 2015.

F. Richter, De novo enzyme design using Rosetta3, PloS one, vol.6, 2011.

N. Robertson and P. D. Seymour, Graph minors. II. Algorithmic aspects of tree-width, Journal of Algorithms, vol.7, pp.309-322, 1986.

T. Sang, P. Beame, and H. Kautz, Solving Bayesian networks by weighted model counting, Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI-05), vol.1, pp.475-482, 2005.

T. Sang, P. Beame, and H. A. Kautz, Performing Bayesian inference by weighted model counting, In: AAAI, vol.5, pp.475-481, 2005.

T. Schiex, Arc consistency for soft constraints, Principles and Practice of Constraint Programming -CP 2000, vol.1894, pp.411-424, 2000.

T. Schiex, H. Fargier, and G. Verfaillie, Valued Constraint Satisfaction Problems: hard and easy problems, Proc. of the 14 th IJCAI, pp.631-637, 1995.
URL : https://hal.archives-ouvertes.fr/hal-02778456

M. I. Schlesinger, Sintaksicheskiy analiz dvumernykh zritelnikh signalov v usloviyakh pomekh (Syntactic analysis of two-dimensional visual signals in noisy conditions), In: Kibernetika, vol.4, pp.113-130, 1976.

V. Maxim, R. L. Shapovalov, and . Dunbrack, A smoothed backbone-dependent rotamer library for proteins derived from adaptive kernel density estimates and regressions, In: Structure, vol.19, pp.844-858, 2011.

P. Shenoy, Valuation-based systems for discrete optimization, Uncertainty in AI, 1991.

D. Sontag, Tightening LP relaxations for MAP using message passing, 2012.

P. Swoboda, Partial optimality by pruning for MAP-inference with general graphical models, Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp.1170-1177, 2014.

M. Thurley, sharpSAT-counting models with advanced component caching and implicit BCP, International Conference on Theory and Applications of Satisfiability Testing, pp.424-429, 2006.

S. Toda, On the computational power of PP and ?P, Foundations of Computer Science, pp.514-519, 1989.

S. Traoré, Fast search algorithms for computational protein design, Journal of computational chemistry, 2016.

P. Tuffery, A new approach to the rapid determination of protein side chain conformations, Journal of Biomolecular structure and dynamics, vol.8, pp.1267-1289, 1991.
URL : https://hal.archives-ouvertes.fr/hal-00313445

C. Viricel, Guaranteed Weighted Counting for Affinity Computation: Beyond Determinism and Structure, Proc. of the 22nd International Conference on Principles and Practice of Constraint Programming, pp.736-750, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01606791

Q. Wang, A. A. Canutescu, and R. L. Dunbrack, SCWRL and MolIDE: computer programs for side-chain conformation prediction and homology modeling, Nature protocols 3, vol.12, pp.1832-1847, 2008.

T. Werner, A Linear Programming Approach to Max-sum Problem: A Review, IEEE Trans. on Pattern Recognition and Machine Intelligence, vol.29, pp.1165-1179, 2007.

J. Xu and B. Berger, Fast and accurate algorithms for protein side-chain packing, Journal of the ACM (JACM), vol.53, issue.4, pp.533-557, 2006.