Cost function network‐based design of protein‐protein interactions: predicting changes in binding affinity

Motivation: Accurate and economic methods to predict change in protein binding free energy upon mutation are imperative to accelerate the design of proteins for a wide range of applications. Free energy is defined by enthalpic and entropic contributions. Following the recent progresses of Artificial Intelligence‐based algorithms for guaranteed NP‐hard energy optimization and partition function computation, it becomes possible to quickly compute minimum energy conformations and to reliably estimate the entropic contribution of side‐chains in the change of free energy of large protein interfaces. Results: Using guaranteed Cost Function Network algorithms, Rosetta energy functions and Dunbrack's rotamer library, we developed and assessed EasyE and JayZ, two methods for binding affinity estimation that ignore or include conformational entropic contributions on a large benchmark of binding affinity experimental measures. If both approaches outperform most established tools, we observe that side‐chain conformational entropy brings little or no improvement on most systems but becomes crucial in some rare cases. Availability and implementation: as open‐source Python/C++ code at sourcesup.renater.fr/projects/easy‐jayz. Supplementary information: Supplementary data are available at Bioinformatics online.

[1]  Wei Zheng,et al.  BindProfX: Assessing Mutation-Induced Binding Affinity Change by Protein Interface Profiles with Pseudo-Counts. , 2017, Journal of molecular biology.

[2]  Douglas E. V. Pires,et al.  mCSM: predicting the effects of mutations in proteins using graph-based signatures , 2013, Bioinform..

[3]  Thomas Schiex,et al.  Valued Constraint Satisfaction Problems: Hard and Easy Problems , 1995, IJCAI.

[4]  D. Beveridge,et al.  Free energy via molecular simulation: applications to chemical and biomolecular systems. , 1989, Annual review of biophysics and biophysical chemistry.

[5]  D. Baker,et al.  Role of conformational sampling in computing mutation‐induced changes in protein structure and stability , 2011, Proteins.

[6]  Daniel F. A. R. Dourado,et al.  A multiscale approach to predicting affinity changes in protein–protein interfaces , 2014, Proteins.

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

[8]  David E. Kim,et al.  Simultaneous Optimization of Biomolecular Energy Functions on Features from Small Molecules and Macromolecules. , 2016, Journal of chemical theory and computation.

[9]  Anna R. Panchenko,et al.  MutaBind estimates and interprets the effects of sequence variants on protein–protein interactions , 2016, Nucleic Acids Res..

[10]  Mark A Hallen,et al.  Dead‐end elimination with perturbations (DEEPer): A provable protein design algorithm with continuous sidechain and backbone flexibility , 2013, Proteins.

[11]  Sergey Lyskov,et al.  PyRosetta: a script-based interface for implementing molecular modeling algorithms using Rosetta , 2010, Bioinform..

[12]  Simon de Givry,et al.  Searching RNA motifs and their intermolecular contacts with constraint networks , 2020 .

[13]  Barry O'Sullivan,et al.  Multi-language evaluation of exact solvers in graphical model discrete optimization , 2016, Constraints.

[14]  L. Serrano,et al.  Predicting changes in the stability of proteins and protein complexes: a study of more than 1000 mutations. , 2002, Journal of molecular biology.

[15]  S. Anderson,et al.  Binding of amino acid side-chains to S1 cavities of serine proteinases. , 1997, Journal of molecular biology.

[16]  Nir Friedman,et al.  Probabilistic Graphical Models - Principles and Techniques , 2009 .

[17]  Bracken M. King,et al.  Efficient Computation of Small-Molecule Configurational Binding Entropy and Free Energy Changes by Ensemble Enumeration , 2013, Journal of chemical theory and computation.

[18]  Bruce Randall Donald,et al.  Fast search algorithms for computational protein design , 2016, J. Comput. Chem..

[19]  Bruce Randall Donald,et al.  A Novel Ensemble-Based Scoring and Search Algorithm for Protein Redesign and Its Application to Modify the Substrate Specificity of the Gramicidin Synthetase A Phenylalanine Adenylation Enzyme , 2005, J. Comput. Biol..

[20]  Pablo Gainza,et al.  Compact Representation of Continuous Energy Surfaces for More Efficient Protein Design. , 2015, Journal of chemical theory and computation.

[21]  Simon de Givry,et al.  Radio Link Frequency Assignment , 1999, Constraints.

[22]  Christophe Chipot,et al.  Frontiers in free‐energy calculations of biological systems , 2014 .

[23]  Christina Kiel,et al.  Structure‐energy‐based predictions and network modelling of RASopathy and cancer missense mutations , 2014, Molecular systems biology.

[24]  M. Michael Gromiha,et al.  PROXiMATE: a database of mutant protein-protein complex thermodynamics and kinetics , 2017, Bioinform..

[25]  Thomas Schiex,et al.  Guaranteed Discrete Energy Optimization on Large Protein Design Problems. , 2015, Journal of chemical theory and computation.

[26]  Daniel F. A. R. Dourado,et al.  Modeling and fitting protein-protein complexes to predict change of binding energy , 2016, Scientific Reports.

[27]  Adnan Darwiche,et al.  On probabilistic inference by weighted model counting , 2008, Artif. Intell..

[28]  T. N. Bhat,et al.  The Protein Data Bank , 2000, Nucleic Acids Res..

[29]  Marianne Rooman,et al.  BeAtMuSiC: prediction of changes in protein–protein binding affinity on mutations , 2013, Nucleic Acids Res..

[30]  Christophe Chipot,et al.  Can Absolute Free Energies of Association Be Estimated from Molecular Mechanical Simulations? The Biotin−Streptavidin System Revisited , 2001 .

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

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

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

[34]  Roland L. Dunbrack,et al.  The Rosetta all-atom energy function for macromolecular modeling and design , 2017, bioRxiv.

[35]  C. Langmead,et al.  Accounting for conformational entropy in predicting binding free energies of protein‐protein interactions , 2011, Proteins.

[36]  J. Åqvist,et al.  Ligand binding affinities from MD simulations. , 2002, Accounts of chemical research.

[37]  Juan Fernández-Recio,et al.  SKEMPI: a Structural Kinetic and Energetic database of Mutant Protein Interactions and its use in empirical models , 2012, Bioinform..

[38]  Zhiping Weng,et al.  Structure‐based design of a T‐cell receptor leads to nearly 100‐fold improvement in binding affinity for pepMHC , 2009, Proteins.

[39]  Zhiping Weng,et al.  Computational Design of the Affinity and Specificity of a Therapeutic T Cell Receptor , 2014, PLoS Comput. Biol..

[40]  David Baker,et al.  Computational design of ligand-binding proteins with high affinity and selectivity , 2013, Nature.

[41]  D. Baker,et al.  A simple physical model for binding energy hot spots in protein–protein complexes , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[42]  François Stricher,et al.  The FoldX web server: an online force field , 2005, Nucleic Acids Res..

[43]  R. Goldstein.  Efficient rotamer elimination applied to protein side-chains and related spin glasses. , 1994, Biophysical journal.

[44]  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.

[45]  Thomas Schiex,et al.  DARN! A Weighted Constraint Solver for RNA Motif Localization , 2007, Constraints.

[46]  Daniele Sciretti,et al.  Computational protein design with side‐chain conformational entropy , 2009, Proteins.

[47]  A R Leach,et al.  Exploring the conformational space of protein side chains using dead‐end elimination and the A* algorithm , 1998, Proteins.

[48]  Yang Zhang,et al.  Predicting the Effect of Mutations on Protein-Protein Binding Interactions through Structure-Based Interface Profiles , 2015, PLoS Comput. Biol..

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

[50]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..