Approximate Counting with Deterministic Guarantees for Affinity Computation

Computational Protein Design aims at rationally designing amino-acid sequences that fold into a given three-dimensional structure and that will bestow the designed protein with desirable properties/functions. Usual criteria for design include stability of the designed protein and affinity between it and a ligand of interest. However, estimating the affinity between two molecules requires to compute the partition function, a #P-complete problem.

[1]  Roland L. Dunbrack,et al.  A smoothed backbone-dependent rotamer library for proteins derived from adaptive kernel density estimates and regressions. , 2011, Structure.

[2]  Bruce Randall Donald,et al.  A Novel 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 , 2006, RECOMB.

[3]  A. R. Fresht.  Structure and Mechanism in Protein Science: A Guide to Enzyme Catalysis and Protein Folding , 1999 .

[4]  Javier Larrosa,et al.  Resolution in Max-SAT and its relation to local consistency in weighted CSPs , 2005, IJCAI.

[5]  Martin C. Cooper,et al.  Soft arc consistency revisited , 2010, Artif. Intell..

[6]  Lakhdar Sais,et al.  Boosting Systematic Search by Weighting Constraints , 2004, ECAI.

[7]  Rina Dechter,et al.  Principles and Practice of Constraint Programming – CP 2000 , 2001, Lecture Notes in Computer Science.

[8]  C. Pabo.  Molecular technology: Designing proteins and peptides , 1983, Nature.

[9]  Johan Desmet,et al.  The dead-end elimination theorem and its use in protein side-chain positioning , 1992, Nature.

[10]  Simon de Givry,et al.  A new framework for computational protein design through cost function network optimization , 2013, Bioinform..

[11]  Niles A Pierce,et al.  Protein design is NP-hard. , 2002, Protein engineering.

[12]  Simon de Givry,et al.  Computational protein design as an optimization problem , 2014, Artif. Intell..

[13]  Simon de Givry,et al.  Existential arc consistency: Getting closer to full arc consistency in weighted CSPs , 2005, IJCAI.

[14]  Franz Rendl,et al.  Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations , 2009, Math. Program..

[15]  Dan S. Tawfik,et al.  Protein engineers turned evolutionists , 2007, Nature Methods.

[16]  J. Richardson,et al.  The penultimate rotamer library , 2000, Proteins.

[17]  Lakhdar Sais,et al.  Reasoning from last conflict(s) in constraint programming , 2009, Artif. Intell..

[18]  Reuven Y. Rubinstein,et al.  Fast Sequential Monte Carlo Methods for Counting and Optimization , 2013 .

[19]  Pablo Gainza,et al.  Osprey: Protein Design with Ensembles, Flexibility, and Provable Algorithms , 2022 .

[20]  Jasmine L. Gallaher,et al.  Computational Design of an Enzyme Catalyst for a Stereoselective Bimolecular Diels-Alder Reaction , 2010, Science.

[21]  Alessandro Senes,et al.  Backbone dependency further improves side chain prediction efficiency in the Energy‐based Conformer Library (bEBL) , 2014, Proteins.

[22]  Toniann Pitassi,et al.  Combining Component Caching and Clause Learning for Effective Model Counting , 2004, SAT.

[23]  Javier Larrosa,et al.  Boosting Search with Variable Elimination , 2000, CP.

[24]  Toby Walsh,et al.  Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.

[25]  Brian Kuhlman,et al.  Structure-based design of supercharged, highly thermoresistant antibodies. , 2012, Chemistry & biology.

[26]  Adnan Darwiche,et al.  Compiling Probabilistic Graphical Models Using Sentential Decision Diagrams , 2013, ECSQARU.