Native fold and docking pose discrimination by the same residue-based scoring function

Computational Mutagenesis of Antibody Fragments: Disentangling Side Chains from ΔΔG Predictions

The development of highly potent antibodies and antibody fragments as binding agents holds significant implications in fields such as biosensing and biotherapeutics. Their binding strength is intricately linked to the arrangement and composition of residues at the binding interface. Computational techniques offer a robust means to predict the three-dimensional structure of these complexes and to assess the affinity changes resulting from mutations. Given the interdependence of structure and affinity prediction, our objective here is to disentangle their roles. We aim to evaluate independently six side-chain reconstruction methods and ten binding affinity estimation techniques. This evaluation was pivotal in predicting affinity alterations due to single mutations, a key step in computational affinity maturation protocols. Our analysis focuses on a data set comprising 27 distinct antibody/hen egg white lysozyme complexes, each with crystal structures and experimentally determined binding affinities. Using six different side-chain reconstruction methods, we transformed each structure into its corresponding mutant via in silico single-point mutations. Subsequently, these structures undergo minimization and molecular dynamics simulation. We therefore estimate ΔΔG values based on the original crystal structure, its energy-minimized form, and the ensuing molecular dynamics trajectories. Our research underscores the critical importance of selecting reliable side-chain reconstruction methods and conducting thorough molecular dynamics simulations to accurately predict the impact of mutations. In summary, our study demonstrates that the integration of conformational sampling and scoring is a potent approach to precisely characterizing mutation processes in single-point mutagenesis protocols and crucial for computational antibody design.

Replica-exchange optimization of antibody fragments

In the framework of the rational design of macromolecules capable of binding to a specific target for biosensing applications, we here further develop an evolutionary protocol designed to optimize the binding affinity of protein binders. In particular we focus on the optimization of the binding portion of small antibody fragments known as nanobodies (or VHH) and choose the hen egg white lysozyme (HEWL) as our target. By implementing a replica exchange scheme for this optimization, we show that an initial hit is not needed and similar solutions can be found by either optimizing an already known anti-HEWL VHH or a randomly selected binder (here a VHH selective towards another macromolecule). While we believe that exhaustive searches of the mutation space are most appropriate when only few key residues have to be optimized, in case a lead binder is not available the proposed evolutionary algorithm should be instead the method of choice.

Connection between MHC class II binding and aggregation propensity: The antigenic peptide 10 of Paracoccidioides brasiliensis as a benchmark study

The aggregation of epitopes that are also able to bind major histocompatibility complex (MHC) alleles raises questions around the potential connection between the formation of epitope aggregates and their affinities to MHC receptors. We first performed a general bioinformatic assessment over a public dataset of MHC class II epitopes, finding that higher experimental binding correlates with higher aggregation-propensity predictors. We then focused on the case of P10, an epitope used as a vaccine candidate against Paracoccidioides brasiliensis that aggregates into amyloid fibrils. We used a computational protocol to design variants of the P10 epitope to study the connection between the binding stabilities towards human MHC class II alleles and their aggregation propensities. The binding of the designed variants was tested experimentally, as well as their aggregation capacity. High-affinity MHC class II binders in vitro were more disposed to aggregate forming amyloid fibrils capable of binding Thioflavin T and congo red, while low affinity MHC class II binders remained soluble or formed rare amorphous aggregates. This study shows a possible connection between the aggregation propensity of an epitope and its affinity for the MHC class II cleft.

Antibody Affinity Maturation Using Computational Methods: From an Initial Hit to Small-Scale Expression of Optimized Binders

Nanobodies (VHHs) are engineered fragments of the camelid single-chain immunoglobulins. The VHH domain contains the highly variable segments responsible for antigen recognition. VHHs can be easily produced as recombinant proteins. Their small size is a good advantage for in silico approaches. Computer methods represent a valuable strategy for the optimization and improvement of their binding affinity. They also allow for epitope selection offering the possibility to design new VHHs for regions of a target protein that are not naturally immunogenic. Here we present an in silico mutagenic protocol developed to improve the binding affinity of nanobodies together with the first step of their in vitro production. The method, already proven successful in improving the low Kd of a nanobody hit obtained by panning, can be employed for the ex novo design of antibody fragments against selected protein target epitopes.

Illuminating the "Twilight Zone": Advances in Difficult Protein Modeling

Homology modeling was long considered a method of choice in tertiary protein structure prediction. However, it used to provide models of acceptable quality only when templates with appreciable sequence identity with a target could be found. The threshold value was long assumed to be around 20-30%. Below this level, obtained sequence identity was getting dangerously close to values that can be obtained by chance, after aligning any random, unrelated sequences. In these cases, other approaches, including ab initio folding simulations or fragment assembly, were usually employed. The most recent editions of the CASP and CAMEO community-wide modeling methods assessment have brought some surprising outcomes, proving that much more clues can be inferred from protein sequence analyses than previously thought. In this chapter, we focus on recent advances in the field of difficult protein modeling, pushing the threshold deep into the "twilight zone", with particular attention devoted to improvements in applications of machine learning and model evaluation.

Statistical potentials from the Gaussian scaling behaviour of chain fragments buried within protein globules

Knowledge-based approaches use the statistics collected from protein data-bank structures to estimate effective interaction potentials between amino acid pairs. Empirical relations are typically employed that are based on the crucial choice of a reference state associated to the null interaction case. Despite their significant effectiveness, the physical interpretation of knowledge-based potentials has been repeatedly questioned, with no consensus on the choice of the reference state. Here we use the fact that the Flory theorem, originally derived for chains in a dense polymer melt, holds also for chain fragments within the core of globular proteins, if the average over buried fragments collected from different non-redundant native structures is considered. After verifying that the ensuing Gaussian statistics, a hallmark of effectively non-interacting polymer chains, holds for a wide range of fragment lengths, although with significant deviations at short spatial scales, we use it to define a ‘bona fide’ reference state. Notably, despite the latter does depend on fragment length, deviations from it do not. This allows to estimate an effective interaction potential which is not biased by the presence of correlations due to the connectivity of the protein chain. We show how different sequence-independent effective statistical potentials can be derived using this approach by coarse-graining the protein representation at varying levels. The possibility of defining sequence-dependent potentials is explored.

A consensus protocol for the in silico optimisation of antibody fragments

We present an in silico mutagenetic protocol for improving the binding affinity of single domain antibodies (or nanobodies, VHHs). The method iteratively attempts random mutations in the interacting region of the protein and evaluates the resulting binding affinity towards the target by scoring, with a collection of scoring functions, short explicit solvent molecular dynamics trajectories of the binder-target complexes. The acceptance/rejection of each attempted mutation is carried out by a consensus decision-making algorithm, which considers all individual assessments derived from each scoring function. The method was benchmarked by evolving a single complementary determining region (CDR) of an anti-HER2 VHH hit obtained by direct panning of a phage display library. The optimised VHH mutant showed significantly enhanced experimental affinity with respect to the original VHH it matured from. The protocol can be employed as it is for the optimization of peptides, antibody fragments, and (given enough computational power) larger antibodies.

Predicting the Affinity of Peptides to Major Histocompatibility Complex Class II by Scoring Molecular Dynamics Simulations

Predicting the binding affinity of peptides able to interact with major histocompatibility complex (MHC) molecules is a priority for researchers working in the identification of novel vaccines candidates. Most available approaches are based on the analysis of the sequence of peptides of known experimental affinity. However, for MHC class II receptors, these approaches are not very accurate, due to the intrinsic flexibility of the complex. To overcome these limitations, we propose to estimate the binding affinity of peptides bound to an MHC class II by averaging the score of the configurations from finite-temperature molecular dynamics simulations. The score is estimated for 18 different scoring functions, and we explored the optimal manner for combining them. To test the predictions, we considered eight peptides of known binding affinity. We found that six scoring functions correlate with the experimental ranking of the peptides significantly better than the others. We then assessed a set of techniques for combining the scoring functions by linear regression and logistic regression. We obtained a maximum accuracy of 82% for the predicted sign of the binding affinity using a logistic regression with optimized weights. These results are potentially useful to improve the reliability of in silico protocols to design high-affinity binding peptides for MHC class II receptors.

Toward a unified scoring function for native state discrimination and drug-binding pocket recognition

Protein folding and receptor-ligand recognition are fundamental processes for any living organism. Although folding and ligand recognition are based on the same chemistry, the existing empirical scoring functions target just one problem: predicting the correct fold or the correct binding pose. We here introduce a statistical potential which considers moieties as fundamental units. The scoring function is able to deal with both folding and ligand pocket recognition problems with a performance comparable to the scoring functions specifically tailored for one of the two tasks. We foresee that the capability of the new scoring function to tackle both problems in a unified framework will be a key to deal with the induced fit phenomena, in which a target protein changes significantly its conformation upon binding. Moreover, the new scoring function might be useful in docking protocols towards intrinsically disordered proteins, whose flexibility cannot be handled with the available docking software.

Binding affinity prediction of nanobody-protein complexes by scoring of molecular dynamics trajectories

Nanobodies offer a viable alternative to antibodies for engineering high affinity binders. Their small size has an additional advantage: it allows exploiting computational protocols for optimizing their biophysical features, such as the binding affinity. The efficient prediction of this quantity is still considered a daunting task especially for modelled complexes. We show how molecular dynamics can successfully assist in the binding affinity prediction of modelled nanobody-protein complexes. The approximate initial configurations obtained by in silico design must undergo large rearrangements before achieving a stable conformation, in which the binding affinity can be meaningfully estimated. The scoring functions developed for the affinity evaluation of crystal structures will provide accurate estimates for modelled binding complexes if the scores are averaged over long finite temperature molecular dynamics simulations.

Rigid-Docking Approaches to Explore Protein-Protein Interaction Space

Protein-protein interactions play core roles in living cells, especially in the regulatory systems. As information on proteins has rapidly accumulated on publicly available databases, much effort has been made to obtain a better picture of protein-protein interaction networks using protein tertiary structure data. Predicting relevant interacting partners from their tertiary structure is a challenging task and computer science methods have the potential to assist with this. Protein-protein rigid docking has been utilized by several projects, docking-based approaches having the advantages that they can suggest binding poses of predicted binding partners which would help in understanding the interaction mechanisms and that comparing docking results of both non-binders and binders can lead to understanding the specificity of protein-protein interactions from structural viewpoints. In this review we focus on explaining current computational prediction methods to predict pairwise direct protein-protein interactions that form protein complexes.