D. Allouche, I. André, S. Barbe, J. Davies, S. De-givry et al., Computational protein design as an optimization problem, Artificial Intelligence, vol.212, pp.59-79, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01268554

D. Allouche, S. De-givry, G. Katsirelos, T. Schiex, and M. Zytnicki, Anytime Hybrid Best-First Search with Tree Decomposition for Weighted CSP, Proc. of CP-15, pp.12-28, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01198361

D. Allouche, S. Traoré, I. André, S. De-givry, G. Katsirelos et al., Computational protein design as a cost function network optimization problem, Principles and Practice of Constraint Programming, pp.840-849, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01191320

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

F. E. Boas and P. B. Harbury, Potential energy functions for protein design, Current opinion in structural biology, vol.17, issue.2, pp.199-204, 2007.

J. U. Bowie, R. Luthy, and D. Eisenberg, A method to identify protein sequences that fold into a known three-dimensional structure, Science, vol.253, issue.5016, pp.164-170, 1991.

F. Campeotto, A. Dal-palã?, A. Dovier, F. Fioretto, and E. Pontelli, A constraint solver for flexible protein models, J. Artif. Int. Res. (JAIR), vol.48, issue.1, pp.953-1000, 2013.

J. M. Carothers, J. A. Goler, and J. D. Keasling, Chemical synthesis using synthetic biology, Current opinion in biotechnology, vol.20, issue.4, pp.498-503, 2009.

D. Case, T. Darden, I. Cheatham, T. Simmerling, C. Wang et al., , 2006.

E. Champion, I. André, C. Moulis, J. Boutet, K. Descroix et al., Design of ?-transglucosidases of controlled specificity for programmed chemoenzymatic synthesis of antigenic oligosaccharides, Journal of the American Chemical Society, vol.131, issue.21, pp.7379-7389, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00414248

A. Charpentier, D. Mignon, S. Barbe, J. Cortes, T. Schiex et al., Variable neighborhood search with cost function networks to solve large computational protein design problems, Journal of Chemical Information and Modeling, vol.59, issue.1, pp.127-136, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01943616

A. B. Chowdry, K. A. Reynolds, M. S. Hanes, M. Voorhies, N. Pokala et al., An object-oriented library for computational protein design, J. Comput. Chem, vol.28, issue.14, pp.2378-2388, 2007.

M. Cooper, S. De-givry, M. Sanchez, T. Schiex, M. Zytnicki et al., Soft arc consistency revisited, Artificial Intelligence, vol.174, pp.449-478, 2010.

M. C. Cooper, High-order consistency in Valued Constraint Satisfaction, Constraints, vol.10, pp.283-305, 2005.

M. C. Cooper, S. De-givry, M. Sánchez, T. Schiex, and M. Zytnicki, Virtual arc consistency for weighted CSP, Proc. of AAAI'08, vol.8, pp.253-258, 2008.

M. C. Cooper, S. De-givry, and T. Schiex, Optimal soft arc consistency, Proc. of IJCAI'2007, pp.68-73, 2007.

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

B. I. Dahiyat and S. L. Mayo, Protein design automation, Protein science, vol.5, issue.5, pp.895-903, 1996.

J. Desmet, M. De-maeyer, B. Hazes, and I. Lasters, The dead-end elimination theorem and its use in protein side-chain positioning, Nature, vol.356, issue.6369, pp.539-581, 1992.

J. Desmet, J. Spriet, and I. Lasters, Fast and accurate side-chain topology and energy refinement (FASTER) as a new method for protein structure optimization, Proteins, vol.48, issue.1, pp.31-43, 2002.

A. Fersht, Structure and mechanism in protein science: a guide to enzyme catalysis and protein folding, 1999.

M. Fontaine, S. Loudni, and P. Boizumault, Exploiting tree decomposition for guiding neighborhoods exploration for VNS, RAIRO OR, vol.47, issue.2, pp.91-123, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01628137

E. C. Freuder, Eliminating interchangeable values in constraint satisfaction problems, Proc. of AAAI'91, pp.227-233, 1991.

A. L. Friesen and P. Domingos, Recursive decomposition for nonconvex optimization, Proceedings of the 24th International Conference on Artificial Intelligence (IJCAI'15), pp.253-259, 2015.

B. R. Fritz, L. E. Timmerman, N. M. Daringer, J. N. Leonard, and M. C. Jewett, Biology by design: from top to bottom and back, 2010.

P. Gainza, K. E. Roberts, I. Georgiev, R. H. Lilien, D. A. Keedy et al., Osprey: Protein design with ensembles, flexibility, and provable algorithms, 2012.

I. Georgiev, R. H. Lilien, and B. R. Donald, Improved Pruning algorithms and Divide-and-Conquer strategies for Dead-End Elimination, with application to protein design, Bioinformatics, vol.22, issue.14, pp.174-83, 2006.

I. Georgiev, R. H. Lilien, and B. R. 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, pp.1527-1569, 2008.

S. De-givry, S. Prestwich, and B. O'sullivan, Dead-End Elimination for Weighted CSP, Proc. of CP-13, pp.263-272, 2013.

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

D. Gront, D. W. Kulp, R. M. Vernon, C. E. Strauss, and D. Baker, Generalized fragment picking in rosetta: design, protocols and applications, PloS one, vol.6, issue.8, p.23294, 2011.

I. Grunwald, K. Rischka, S. M. Kast, T. Scheibel, and H. Bargel, Mimicking biopolymers on a molecular scale: nano(bio)technology based on engineered proteins. Philosophical transactions, Series A, Mathematical, physical, and engineering sciences, vol.367, pp.1727-1774, 1894.

M. A. Hallen, D. A. Keedy, and B. R. Donald, Dead-end elimination with perturbations (deeper): A provable protein design algorithm with continuous sidechain and backbone flexibility, Proteins: Structure, Function, and Bioinformatics, vol.81, issue.1, pp.18-39, 2013.

W. D. Harvey and M. L. Ginsberg, Limited discrepancy search, Proc. of the 14 t h IJCAI, 1995.

G. Hawkins, C. Cramer, and D. Truhlar, Parametrized models of aqueous free energies of solvation based on pairwise descreening of solute atomic charges from a dielectric medium, The Journal of Physical Chemistry, vol.100, issue.51, pp.19824-19839, 1996.

B. Hurley, B. O'sullivan, D. Allouche, G. Katsirelos, T. Schiex et al., Multi-Language Evaluation of Exact Solvers in Graphical Model Discrete Optimization, Constraints, vol.21, issue.3, pp.413-434, 2016.

J. Janin, S. Wodak, M. Levitt, and B. Maigret, Conformation of amino acid side-chains in proteins, Journal of molecular biology, vol.125, issue.3, pp.357-386, 1978.

A. S. Khalil and J. J. Collins, Synthetic biology: applications come of age, Nature Reviews Genetics, vol.11, issue.5, pp.367-379, 2010.

S. D. Khare, Y. Kipnis, P. Greisen, R. Takeuchi, Y. Ashani et al., Computational redesign of a mononuclear zinc metalloenzyme for organophosphate hydrolysis, Nature chemical biology, vol.8, issue.3, pp.294-300, 2012.

G. A. Khoury, J. Smadbeck, C. A. Kieslich, and C. A. Floudas, Protein folding and de novo protein design for biotechnological applications, Trends in biotechnology, vol.32, issue.2, pp.99-109, 2014.

C. L. Kingsford, B. Chazelle, and M. Singh, Solving and analyzing side-chain positioning problems using linear and integer programming, Bioinformatics, vol.21, issue.7, pp.1028-1064, 2005.

B. Kuhlman and D. Baker, Native protein sequences are close to optimal for their structures, Proceedings of the National Academy of Sciences of the United States of America, vol.97, pp.10383-10391, 2000.

J. Larrosa, On arc and node consistency in weighted CSP, Proc. AAAI'02, pp.48-53, 2002.

J. Larrosa, S. De-givry, F. Heras, and M. Zytnicki, Existential arc consistency: getting closer to full arc consistency in weighted CSPs, Proc. of the 19 t h IJCAI, pp.84-89, 2005.

J. Larrosa and T. Schiex, Solving weighted CSP by maintaining arc consistency, Artif. Intell, vol.159, issue.1-2, pp.1-26, 2004.

A. R. Leach and A. P. Lemon, Exploring the conformational space of protein side chains using dead-end elimination and the A* algorithm, Proteins, vol.33, issue.2, pp.227-266, 1998.

A. Leaver-fay, M. Tyka, S. M. Lewis, O. F. Lange, J. Thompson et al., Rosetta3: an object-oriented software suite for the simulation and design of macromolecules, Methods Enzymol, vol.487, pp.545-574, 2011.

C. Lecoutre, O. Roussel, and D. 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

J. C. Lewis, S. Bastian, C. S. Bennett, Y. Fu, Y. Mitsuda et al., Chemoenzymatic elaboration of monosaccharides using engineered cytochrome p450bm3 demethylases, Proceedings of the National Academy of Sciences, vol.106, issue.39, pp.16550-16555, 2009.

L. L. Looger and H. W. 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, issue.1, pp.429-474, 2001.

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

S. C. Lovell, J. M. Word, J. S. Richardson, and D. C. Richardson, The penultimate rotamer library, Proteins, vol.40, issue.3, pp.389-408, 2000.

V. J. Martin, D. J. Pitera, S. T. Withers, J. D. Newman, and J. D. Keasling, Engineering a mevalonate pathway in escherichia coli for production of terpenoids, Nature biotechnology, vol.21, issue.7, pp.796-802, 2003.

N. Mladenovi? and P. Hansen, Variable Neighborhood Search, Comput. Oper. Res, vol.24, issue.11, pp.1097-1100, 1997.

B. M. Nestl, B. A. Nebel, and B. Hauer, Recent progress in industrial biocatalysis, Current Opinion in Chemical Biology, vol.15, issue.2, pp.187-193, 2011.

H. Noguchi, C. Addy, D. Simoncini, S. Wouters, B. Mylemans et al., Computational design of symmetrical eight-bladed ?-propeller proteins, IUCrJ, vol.6, issue.1, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02154353

M. J. O'meara, A. Leaver-fay, M. Tyka, A. Stein, K. Houlihan et al., A combined covalent-electrostatic model of hydrogen bonding improves structure prediction with rosetta, J. Chem. Theory Comput, vol.11, issue.2, pp.609-622, 2015.

A. Ouali, D. Allouche, S. De-givry, S. Loudni, Y. Lebbah et al., Iterative Decomposition Guided Variable Neighborhood Search for Graphical Model Energy Minimization, Proc. of UAI-17, pp.550-559, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01628162

C. Pabo, Molecular technology. Designing proteins and peptides, Nature, vol.301, issue.5897, p.200, 1983.

S. G. Peisajovich and D. S. Tawfik, Protein engineers turned evolutionists, Nature methods, vol.4, issue.12, pp.991-995, 2007.

N. Pierce, J. Spriet, J. Desmet, and S. Mayo, Conformational splitting: A more powerful criterion for dead-end elimination, Journal of computational chemistry, vol.21, issue.11, pp.999-1009, 2000.

N. A. Pierce and E. Winfree, Protein design is NP-hard, Protein engineering, vol.15, issue.10, pp.779-82, 2002.

J. Pleiss, Protein design in metabolic engineering and synthetic biology, Current opinion in biotechnology, vol.22, issue.5, pp.611-618, 2011.

K. Raha, A. M. Wollacott, M. J. Italia, and J. R. Desjarlais, Prediction of amino acid sequence from structure, Protein science, vol.9, issue.6, pp.1106-1125, 2000.

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

D. Simoncini, D. Allouche, S. De-givry, C. Delmas, S. Barbe et al., Guaranteed discrete energy optimization on large protein design problems, Journal of Chemical Theory and Computation, vol.11, issue.12, pp.5980-5989, 2015.

M. Swain and G. Kemp, A CLP approach to the protein side-chain placement problem. In: Principles and Practice of Constraint Programming-CP, pp.479-493, 2001.

S. Traoré, D. Allouche, I. André, S. De-givry, G. Katsirelos et al., A new framework for computational protein design through cost function network optimization, Bioinformatics, vol.29, issue.17, pp.2129-2136, 2013.

S. Traoré, K. E. Roberts, D. Allouche, B. R. Donald, I. André et al., Fast search algorithms for computational protein design, Journal of computational chemistry, vol.37, issue.12, pp.1048-1058, 2016.

A. Verges, E. Cambon, S. Barbe, S. Salamone, Y. Le-guen et al., Computer-aided engineering of a transglycosylase for the glucosylation of an unnatural disaccharide of relevance for bacterial antigen synthesis, ACS Catalysis, vol.5, issue.2, pp.1186-1198, 2015.
URL : https://hal.archives-ouvertes.fr/pasteur-02043360

C. A. Voigt, D. B. Gordon, and S. L. Mayo, Trading accuracy for speed: A quantitative comparison of search algorithms in protein sequence design, Journal of molecular biology, vol.299, issue.3, pp.789-803, 2000.