Over the past decade, Markov State Models (MSM) have emerged as powerful methodologies to build discrete models of dynamics over structures obtained from Molecular Dynamics trajectories. The identification of macrostates for the MSM is a central decision that impacts the quality of the MSM but depends on both the selected representation of a structure and the clustering algorithm utilized over the featurized structures. Motivated by a large molecular system in its free and bound state, this paper investigates two directions of research, further reducing the representation dimensionality in a non-parametric, data-driven manner and including more structures in the computation. Rigorous evaluation of the quality of obtained MSMs via various statistical tests in a comparative setting firmly shows that fewer dimensions and more structures result in a better MSM. Many interesting findings emerge from the best MSM, advancing our understanding of the relationship between antibody dynamics and antibody–antigen recognition.
more »
« less
Antigen Binding Reshapes Antibody Energy Landscape and Conformation Dynamics
This study elucidates the conformation dynamics of the free and antigen-bound antibody. Previous work has verified that antigen binding allosterically promotes Fc receptor recognition. Analysis of extensive molecular dynamics simulations finds that the energy landscape may play a decisive role in coordinating conformation changes but does not provide connections between the various conformational states. Here we provide such a connection. To obtain a detailed understanding of the impact of antigen binding on antibody conformation dynamics, this study utilizes Markov State Models to summarize the conformation dynamics probed in silico. We additionally equip these models with the ability to directly exploit the energy landscape view of dynamics via a computational method that detects energy basins and so allows utilizing detected basins as macrostates for the Markov State Model. Our study reveals many interesting findings and suggests that the antigen-bound form with high energy may provide many dynamic processes to further enhance co-factor binding of the antibody in the next step.
more »
« less
- Award ID(s):
- 1900061
- PAR ID:
- 10343766
- Date Published:
- Journal Name:
- 2021 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)
- Page Range / eLocation ID:
- 2519 to 2526
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
null (Ed.)A growing number of computational tools have been developed to accurately and rapidly predict the impact of amino acid mutations on protein-protein relative binding affinities. Such tools have many applications, for example, designing new drugs and studying evolutionary mechanisms. In the search for accuracy, many of these methods employ expensive yet rigorous molecular dynamics simulations. By contrast, non-rigorous methods use less exhaustive statistical mechanics, allowing for more efficient calculations. However, it is unclear if such methods retain enough accuracy to replace rigorous methods in binding affinity calculations. This trade-off between accuracy and computational expense makes it difficult to determine the best method for a particular system or study. Here, eight non-rigorous computational methods were assessed using eight antibody-antigen and eight non-antibody-antigen complexes for their ability to accurately predict relative binding affinities (ΔΔG) for 654 single mutations. In addition to assessing accuracy, we analyzed the CPU cost and performance for each method using a variety of physico-chemical structural features. This allowed us to posit scenarios in which each method may be best utilized. Most methods performed worse when applied to antibody-antigen complexes compared to non-antibody-antigen complexes. Rosetta-based JayZ and EasyE methods classified mutations as destabilizing (ΔΔG < -0.5 kcal/mol) with high (83–98%) accuracy and a relatively low computational cost for non-antibody-antigen complexes. Some of the most accurate results for antibody-antigen systems came from combining molecular dynamics with FoldX with a correlation coefficient (r) of 0.46, but this was also the most computationally expensive method. Overall, our results suggest these methods can be used to quickly and accurately predict stabilizing versus destabilizing mutations but are less accurate at predicting actual binding affinities. This study highlights the need for continued development of reliable, accessible, and reproducible methods for predicting binding affinities in antibody-antigen proteins and provides a recipe for using current methods.more » « less
-
more » « less
Abstract While immunoglobulins find ubiquitous use in biotechnology as static binders, recent developments have created proantibodies that enable orthogonal switch‐like behavior to antibody function. Previously, peptides with low binding affinity have been genetically fused to antibodies, to proteolytically control binding function by blocking the antigen‐binding site. However, development of these artificial blockers requires panning for peptide sequences that reversibly affect antigen affinity for each antibody. Instead, a more general strategy to achieve dynamic control over antibody affinity may be feasible using protein M (ProtM) from
Mycoplasma genitalium , a newly identified polyspecific immunity evasion protein that is capable of blocking antigen binding for a wide range of antibodies. Using C‐terminus truncation to identify ProtM variants that are still capable of binding to antibodies without the ability to block antigens, we developed a novel and universal biological switch for antibodies. Using a site‐specifically placed thrombin cut site, antibody affinity can be modulated by cleavage of the two distinct antibody‐binding and antigen‐blocking domains of ProtM. Because of the high affinity of ProtM toward a large variety of IgG subtypes, this strategy may be used as a universal approach to create proantibodies that are conditionally activated by disease‐specific proteases such as matrix metalloproteinases. -
more » « less
Introduction: A fundamental challenge in computational vaccinology is that most B-cell epitopes are conformational and therefore hard to predict from sequence alone. Another significant challenge is that a great deal of the amino acid sequence of a viral surface protein might not in fact be antigenic. Thus, identifying the regions of a protein that are most promising for vaccine design based on the degree of surface exposure may not lead to a clinically relevant immune response.Methods: Linear peptides selected by phage display experiments that have high affinity to the monoclonal antibody of interest (“mimotopes”) usually have similar physicochemical properties to the antigen epitope corresponding to that antibody. The sequences of these linear peptides can be used to find possible epitopes on the surface of the antigen structure or a homology model of the antigen in the absence of an antigen-antibody complex structure.Results and Discussion: Herein we describe two novel methods for mapping mimotopes to epitopes. The first is a novel algorithm named MimoTree that allows for gaps in the mimotopes and epitopes on the antigen. More specifically, a mimotope may have a gap that does not match to the epitope to allow it to adopt a conformation relevant for binding to an antibody, and residues may similarly be discontinuous in conformational epitopes. MimoTree is a fully automated epitope detection algorithm suitable for the identification of conformational as well as linear epitopes. The second is an ensemble approach, which combines the prediction results from MimoTree and two existing methods. -
more » « less
Abstract Antibodies are key proteins produced by the immune system to target pathogen proteins termed antigens via specific binding to surface regions called epitopes. Given an antigen and the sequence of an antibody the knowledge of the epitope is critical for the discovery and development of antibody based therapeutics. In this work, we present a computational protocol that uses template‐based modeling and docking to predict epitope residues. This protocol is implemented in three major steps. First, a template‐based modeling approach is used to build the antibody structures. We tested several options, including generation of models using AlphaFold2. Second, each antibody model is docked to the antigen using the fast Fourier transform (FFT) based docking program PIPER. Attention is given to optimally selecting the docking energy parameters depending on the input data. In particular, the van der Waals energy terms are reduced for modeled antibodies relative to x‐ray structures. Finally, ranking of antigen surface residues is produced. The ranking relies on the docking results, that is, how often the residue appears in the docking poses' interface, and also on the energy favorability of the docking pose in question. The method, called PIPER‐Map, has been tested on a widely used antibody–antigen docking benchmark. The results show that PIPER‐Map improves upon the existing epitope prediction methods. An interesting observation is that epitope prediction accuracy starting from antibody sequence alone does not significantly differ from that of starting from unbound (i.e., separately crystallized) antibody structure.
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- https://doi.org/10.1109/BIBM52615.2021.9669830
