1
|
Jenkins NW, Kundrotas PJ, Vakser IA. Size of the protein-protein energy funnel in crowded environment. Front Mol Biosci 2022; 9:1031225. [PMID: 36425657 PMCID: PMC9679368 DOI: 10.3389/fmolb.2022.1031225] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Grants] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 08/29/2022] [Accepted: 10/26/2022] [Indexed: 11/09/2022] Open
Abstract
Association of proteins to a significant extent is determined by their geometric complementarity. Large-scale recognition factors, which directly relate to the funnel-like intermolecular energy landscape, provide important insights into the basic rules of protein recognition. Previously, we showed that simple energy functions and coarse-grained models reveal major characteristics of the energy landscape. As new computational approaches increasingly address structural modeling of a whole cell at the molecular level, it becomes important to account for the crowded environment inside the cell. The crowded environment drastically changes protein recognition properties, and thus significantly alters the underlying energy landscape. In this study, we addressed the effect of crowding on the protein binding funnel, focusing on the size of the funnel. As crowders occupy the funnel volume, they make it less accessible to the ligands. Thus, the funnel size, which can be defined by ligand occupancy, is generally reduced with the increase of the crowders concentration. This study quantifies this reduction for different concentration of crowders and correlates this dependence with the structural details of the interacting proteins. The results provide a better understanding of the rules of protein association in the crowded environment.
Collapse
Affiliation(s)
- Nathan W. Jenkins
- Computational Biology Program, The University of Kansas, Lawrence, KS, United States
| | - Petras J. Kundrotas
- Computational Biology Program, The University of Kansas, Lawrence, KS, United States
- *Correspondence: Petras J. Kundrotas, ; Ilya A. Vakser,
| | - Ilya A. Vakser
- Computational Biology Program, The University of Kansas, Lawrence, KS, United States
- Department of Molecular Biosciences, The University of Kansas, Lawrence, KS, United States
- *Correspondence: Petras J. Kundrotas, ; Ilya A. Vakser,
| |
Collapse
|
2
|
Kotthoff I, Kundrotas PJ, Vakser IA. Dockground
scoring benchmarks for protein docking. Proteins 2022; 90:1259-1266. [DOI: 10.1002/prot.26306] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 09/08/2021] [Revised: 12/06/2021] [Accepted: 01/21/2022] [Indexed: 11/05/2022]
Affiliation(s)
- Ian Kotthoff
- Computational Biology Program The University of Kansas Lawrence Kansas USA
| | | | - Ilya A. Vakser
- Computational Biology Program The University of Kansas Lawrence Kansas USA
- Department of Molecular Biosciences The University of Kansas Lawrence Kansas USA
| |
Collapse
|
3
|
Slater O, Miller B, Kontoyianni M. Decoding Protein-protein Interactions: An Overview. Curr Top Med Chem 2021; 20:855-882. [PMID: 32101126 DOI: 10.2174/1568026620666200226105312] [Citation(s) in RCA: 11] [Impact Index Per Article: 3.7] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 04/13/2019] [Revised: 11/27/2019] [Accepted: 11/27/2019] [Indexed: 12/24/2022]
Abstract
Drug discovery has focused on the paradigm "one drug, one target" for a long time. However, small molecules can act at multiple macromolecular targets, which serves as the basis for drug repurposing. In an effort to expand the target space, and given advances in X-ray crystallography, protein-protein interactions have become an emerging focus area of drug discovery enterprises. Proteins interact with other biomolecules and it is this intricate network of interactions that determines the behavior of the system and its biological processes. In this review, we briefly discuss networks in disease, followed by computational methods for protein-protein complex prediction. Computational methodologies and techniques employed towards objectives such as protein-protein docking, protein-protein interactions, and interface predictions are described extensively. Docking aims at producing a complex between proteins, while interface predictions identify a subset of residues on one protein that could interact with a partner, and protein-protein interaction sites address whether two proteins interact. In addition, approaches to predict hot spots and binding sites are presented along with a representative example of our internal project on the chemokine CXC receptor 3 B-isoform and predictive modeling with IP10 and PF4.
Collapse
Affiliation(s)
- Olivia Slater
- Department of Pharmaceutical Sciences, Southern Illinois University, Edwardsville, IL 62026, United States
| | - Bethany Miller
- Department of Pharmaceutical Sciences, Southern Illinois University, Edwardsville, IL 62026, United States
| | - Maria Kontoyianni
- Department of Pharmaceutical Sciences, Southern Illinois University, Edwardsville, IL 62026, United States
| |
Collapse
|
4
|
Computational approaches to macromolecular interactions in the cell. Curr Opin Struct Biol 2019; 55:59-65. [PMID: 30999240 DOI: 10.1016/j.sbi.2019.03.012] [Citation(s) in RCA: 9] [Impact Index Per Article: 1.8] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 12/24/2018] [Accepted: 03/08/2019] [Indexed: 12/15/2022]
Abstract
Structural modeling of a cell is an evolving strategic direction in computational structural biology. It takes advantage of new powerful modeling techniques, deeper understanding of fundamental principles of molecular structure and assembly, and rapid growth of the amount of structural data generated by experimental techniques. Key modeling approaches to principal types of macromolecular assemblies in a cell already exist. The main challenge, along with the further development of these modeling approaches, is putting them together in a consistent, unified whole cell model. This opinion piece addresses the fundamental aspects of modeling macromolecular assemblies in a cell, and the state-of-the-art in modeling of the principal types of such assemblies.
Collapse
|
5
|
Dietzen M, Kalinina OV, Taškova K, Kneissl B, Hildebrandt AK, Jaenicke E, Decker H, Lengauer T, Hildebrandt A. Large oligomeric complex structures can be computationally assembled by efficiently combining docked interfaces. Proteins 2015; 83:1887-99. [PMID: 26248608 PMCID: PMC5049452 DOI: 10.1002/prot.24873] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.2] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 03/11/2015] [Revised: 07/20/2015] [Accepted: 07/29/2015] [Indexed: 11/06/2022]
Abstract
Macromolecular oligomeric assemblies are involved in many biochemical processes of living organisms. The benefits of such assemblies in crowded cellular environments include increased reaction rates, efficient feedback regulation, cooperativity and protective functions. However, an atom-level structural determination of large assemblies is challenging due to the size of the complex and the difference in binding affinities of the involved proteins. In this study, we propose a novel combinatorial greedy algorithm for assembling large oligomeric complexes from information on the approximate position of interaction interfaces of pairs of monomers in the complex. Prior information on complex symmetry is not required but rather the symmetry is inferred during assembly. We implement an efficient geometric score, the transformation match score, that bypasses the model ranking problems of state-of-the-art scoring functions by scoring the similarity between the inferred dimers of the same monomer simultaneously with different binding partners in a (sub)complex with a set of pregenerated docking poses. We compiled a diverse benchmark set of 308 homo and heteromeric complexes containing 6 to 60 monomers. To explore the applicability of the method, we considered 48 sets of parameters and selected those three sets of parameters, for which the algorithm can correctly reconstruct the maximum number, namely 252 complexes (81.8%) in, at least one of the respective three runs. The crossvalidation coverage, that is, the mean fraction of correctly reconstructed benchmark complexes during crossvalidation, was 78.1%, which demonstrates the ability of the presented method to correctly reconstruct topology of a large variety of biological complexes.
Collapse
Affiliation(s)
- Matthias Dietzen
- Max Planck Institute for Informatics, Campus E1 4, Saarbrücken, 66123, Germany
| | - Olga V Kalinina
- Max Planck Institute for Informatics, Campus E1 4, Saarbrücken, 66123, Germany
| | - Katerina Taškova
- Institute of Computer Science, Johannes Gutenberg University, Staudingerweg 9, Mainz, 55128, Germany.,Institute for Molecular Biology, Johannes Gutenberg University, Ackermannweg 4, Mainz, 55128, Germany
| | - Benny Kneissl
- Institute of Computer Science, Johannes Gutenberg University, Staudingerweg 9, Mainz, 55128, Germany.,Roche Pharma Research and Early Development, pRED Informatics, Roche Innovation Center Penzberg, Nonnenwald 2, Penzberg, 82377, Germany
| | | | - Elmar Jaenicke
- Institute of Molecular Biophysics, Johannes Gutenberg University, Jakob-Welder-Weg 26, Mainz, 55128, Germany
| | - Heinz Decker
- Institute of Molecular Biophysics, Johannes Gutenberg University, Jakob-Welder-Weg 26, Mainz, 55128, Germany
| | - Thomas Lengauer
- Max Planck Institute for Informatics, Campus E1 4, Saarbrücken, 66123, Germany
| | - Andreas Hildebrandt
- Institute of Computer Science, Johannes Gutenberg University, Staudingerweg 9, Mainz, 55128, Germany
| |
Collapse
|
6
|
Vakser IA. Protein-protein docking: from interaction to interactome. Biophys J 2015; 107:1785-1793. [PMID: 25418159 DOI: 10.1016/j.bpj.2014.08.033] [Citation(s) in RCA: 184] [Impact Index Per Article: 20.4] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 07/14/2014] [Revised: 08/17/2014] [Accepted: 08/27/2014] [Indexed: 12/29/2022] Open
Abstract
The protein-protein docking problem is one of the focal points of activity in computational biophysics and structural biology. The three-dimensional structure of a protein-protein complex, generally, is more difficult to determine experimentally than the structure of an individual protein. Adequate computational techniques to model protein interactions are important because of the growing number of known protein structures, particularly in the context of structural genomics. Docking offers tools for fundamental studies of protein interactions and provides a structural basis for drug design. Protein-protein docking is the prediction of the structure of the complex, given the structures of the individual proteins. In the heart of the docking methodology is the notion of steric and physicochemical complementarity at the protein-protein interface. Originally, mostly high-resolution, experimentally determined (primarily by x-ray crystallography) protein structures were considered for docking. However, more recently, the focus has been shifting toward lower-resolution modeled structures. Docking approaches have to deal with the conformational changes between unbound and bound structures, as well as the inaccuracies of the interacting modeled structures, often in a high-throughput mode needed for modeling of large networks of protein interactions. The growing number of docking developers is engaged in the community-wide assessments of predictive methodologies. The development of more powerful and adequate docking approaches is facilitated by rapidly expanding information and data resources, growing computational capabilities, and a deeper understanding of the fundamental principles of protein interactions.
Collapse
Affiliation(s)
- Ilya A Vakser
- Center for Bioinformatics and Department of Molecular Biosciences, The University of Kansas, Lawrence, Kansas.
| |
Collapse
|
7
|
Torchala M, Moal IH, Chaleil RAG, Agius R, Bates PA. A Markov-chain model description of binding funnels to enhance the ranking of docked solutions. Proteins 2013; 81:2143-9. [PMID: 23900714 DOI: 10.1002/prot.24369] [Citation(s) in RCA: 30] [Impact Index Per Article: 2.7] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 05/24/2013] [Revised: 07/03/2013] [Accepted: 07/08/2013] [Indexed: 11/08/2022]
Abstract
Within the crowded, seemingly chaotic environment of the cell, proteins are still able to find their binding partners. This is achieved via an ensemble of trajectories, which funnel them towards their functional binding sites, the binding funnel. Here, we characterize funnel-like energy structures on the global energy landscape using time-homogeneous finite state Markov chain models. These models are based on the idea that transitions can occur between structurally similar docking solutions, with transition probabilities determined by their difference in binding energy. Funnel-like energy structures are those containing solutions with very high equilibrium populations. Although these are found surrounding both near-native and false positive binding sites, we show that the removal of nonfunnel-like energy structures, by filtering away solutions with low maximum equilibrium population, can significantly improve the ranking of docked poses.
Collapse
Affiliation(s)
- Mieczyslaw Torchala
- Biomolecular Modelling Laboratory, Cancer Research UK London Research Institute, London, WC2A 3LY, United Kingdom
| | | | | | | | | |
Collapse
|
8
|
Kundrotas PJ, Vakser IA. Protein-protein alternative binding modes do not overlap. Protein Sci 2013; 22:1141-5. [PMID: 23775945 DOI: 10.1002/pro.2295] [Citation(s) in RCA: 10] [Impact Index Per Article: 0.9] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 02/23/2013] [Revised: 06/01/2013] [Accepted: 06/03/2013] [Indexed: 11/09/2022]
Abstract
Proteins often bind other proteins in more than one way. Thus alternative binding modes is an essential feature of protein interactions. Such binding modes may be detected by X-ray crystallography and thus reflected in Protein Data Bank. The alternative binding is often observed not for the protein itself but for its structural homolog. The results of this study based on the analysis of a comprehensive set of co-crystallized protein-protein complexes show that the alternative binding modes generally do not overlap, but are spatially separated. This effect is based on molecular recognition characteristics of the protein structures. The results are also in excellent agreement with the intermolecular energy funnel size estimates obtained previously by an independent methodology. The results provide an important insight into the principles of protein association, as well as potential guidelines for modeling of protein complexes and the design of protein interfaces.
Collapse
Affiliation(s)
- Petras J Kundrotas
- Center for Bioinformatics and Department of Molecular Biosciences, The University of Kansas, Lawrence, Kansas 66047, USA
| | | |
Collapse
|
9
|
Held M, Metzner P, Prinz JH, Noé F. Mechanisms of protein-ligand association and its modulation by protein mutations. Biophys J 2011; 100:701-710. [PMID: 21281585 DOI: 10.1016/j.bpj.2010.12.3699] [Citation(s) in RCA: 56] [Impact Index Per Article: 4.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 09/22/2010] [Revised: 12/06/2010] [Accepted: 12/08/2010] [Indexed: 10/18/2022] Open
Abstract
Protein-ligand interactions are essential for nearly all biological processes, and yet the biophysical mechanism that enables potential binding partners to associate before specific binding occurs remains poorly understood. Fundamental questions include which factors influence the formation of protein-ligand encounter complexes, and whether designated association pathways exist. To address these questions, we developed a computational approach to systematically analyze the complete ensemble of association pathways. Here, we use this approach to study the binding of a phosphate ion to the Escherichia coli phosphate-binding protein. Various mutants of the protein are considered, and their effects on binding free-energy profiles, association rates, and association pathway distributions are quantified. The results reveal the existence of two anion attractors, i.e., regions that initially attract negatively charged particles and allow them to be efficiently screened for phosphate, which is subsequently specifically bound. Point mutations that affect the charge on these attractors modulate their attraction strength and speed up association to a factor of 10 of the diffusion limit, and thus change the association pathways of the phosphate ligand. It is demonstrated that a phosphate that prebinds to such an attractor neutralizes its attraction effect to the environment, making the simultaneous association of a second phosphate ion unlikely. This study suggests ways in which structural properties can be used to tune molecular association kinetics so as to optimize the efficiency of binding, and highlights the importance of kinetic properties.
Collapse
Affiliation(s)
- Martin Held
- Fachbereich Mathematik und Informatik, Freie Universität Berlin, Berlin, Germany; International Max Planck Research School-Computational Biology and Scientific Computing, Berlin, Germany
| | - Philipp Metzner
- Institute of Computational Science, University of Lugano, Lugano, Switzerland; Deutsche Forschungsgemeinschaft Research Center MATHEON, Berlin, Germany
| | - Jan-Hendrik Prinz
- Fachbereich Mathematik und Informatik, Freie Universität Berlin, Berlin, Germany; Deutsche Forschungsgemeinschaft Research Center MATHEON, Berlin, Germany
| | - Frank Noé
- Fachbereich Mathematik und Informatik, Freie Universität Berlin, Berlin, Germany; Deutsche Forschungsgemeinschaft Research Center MATHEON, Berlin, Germany.
| |
Collapse
|
10
|
Vajda S, Kozakov D. Convergence and combination of methods in protein-protein docking. Curr Opin Struct Biol 2009; 19:164-70. [PMID: 19327983 DOI: 10.1016/j.sbi.2009.02.008] [Citation(s) in RCA: 134] [Impact Index Per Article: 8.9] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 11/06/2008] [Revised: 02/19/2009] [Accepted: 02/24/2009] [Indexed: 10/21/2022]
Abstract
The analysis of results from Critical Assessment of Predicted Interactions (CAPRI), the first community-wide experiment devoted to protein docking, shows that all successful methods consist of multiple stages. The methods belong to three classes: global methods based on fast Fourier transforms (FFTs) or geometric matching, medium-range Monte Carlo methods, and the restraint-guided High Ambiguity Driven biomolecular DOCKing (HADDOCK) program. Although these classes of methods require very different amounts of information in addition to the structures of component proteins, they all share the same four computational steps: firstly, simplified and/or rigid body search; secondly, selecting the region(s) of interest; thirdly, refinement of docked structures; and fourthly, selecting the best models. Although each method is optimal for a specific class of docking problems, combining computational steps from different methods can improve the reliability and accuracy of results.
Collapse
Affiliation(s)
- Sandor Vajda
- Biomolecular Engineering Research Center, Department of Biomedical Engineering, Boston University, 44 Cummington Street, Boston, MA 02215, USA.
| | | |
Collapse
|
11
|
Andrusier N, Mashiach E, Nussinov R, Wolfson HJ. Principles of flexible protein-protein docking. Proteins 2009; 73:271-89. [PMID: 18655061 DOI: 10.1002/prot.22170] [Citation(s) in RCA: 159] [Impact Index Per Article: 10.6] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/06/2022]
Abstract
Treating flexibility in molecular docking is a major challenge in cell biology research. Here we describe the background and the principles of existing flexible protein-protein docking methods, focusing on the algorithms and their rational. We describe how protein flexibility is treated in different stages of the docking process: in the preprocessing stage, rigid and flexible parts are identified and their possible conformations are modeled. This preprocessing provides information for the subsequent docking and refinement stages. In the docking stage, an ensemble of pre-generated conformations or the identified rigid domains may be docked separately. In the refinement stage, small-scale movements of the backbone and side-chains are modeled and the binding orientation is improved by rigid-body adjustments. For clarity of presentation, we divide the different methods into categories. This should allow the reader to focus on the most suitable method for a particular docking problem.
Collapse
Affiliation(s)
- Nelly Andrusier
- School of Computer Science, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv 69978, Israel
| | | | | | | |
Collapse
|
12
|
Ruvinsky AM, Vakser IA. The ruggedness of protein-protein energy landscape and the cutoff for 1/r(n) potentials. Bioinformatics 2009; 25:1132-6. [PMID: 19237445 DOI: 10.1093/bioinformatics/btp108] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.2] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/13/2022] Open
Abstract
MOTIVATION Computational studies of the energetics of protein association are important for revealing the underlying fundamental principles and for designing better tools to model protein complexes. The interaction cutoff contribution to the ruggedness of protein-protein energy landscape is studied in terms of relative energy fluctuations for 1/r(n) potentials based on a simplistic model of a protein complex. This artificial ruggedness exists for short cutoffs and gradually disappears with the cutoff increase. RESULTS The critical values of the cutoff were calculated for each of 11 popular power-type potentials with n=0/9, 12 and for two thresholds of 5% and 10%. The artificial ruggedness decreases to tolerable thresholds for cutoffs larger than the critical ones. The results showed that for both thresholds the critical cutoff is a non-monotonic function of the potential power n. The functions reach the maximum at n=3/4 and then decrease with the increase of the potential power. The difference between two cutoffs for 5% and 10% artificial ruggedness becomes negligible for potentials decreasing faster than 1/r(12). The analytical results obtained for the simple model of protein complexes agree with the analysis of artificial ruggedness in a dataset of 62 protein-protein complexes, with different parameterizations of soft Lennard-Jones potential and two types of protein representations: all-atom and coarse-grained. The results suggest that cutoffs larger than the critical ones can be recommended for protein-protein potentials.
Collapse
Affiliation(s)
- Anatoly M Ruvinsky
- Center for Bioinformatics, The University of Kansas, Lawrence, KS 66047, USA
| | | |
Collapse
|
13
|
Zhu Z, Tovchigrechko A, Baronova T, Gao Y, Douguet D, O'Toole N, Vakser IA. Large-scale structural modeling of protein complexes at low resolution. J Bioinform Comput Biol 2008; 6:789-810. [PMID: 18763743 DOI: 10.1142/s0219720008003679] [Citation(s) in RCA: 5] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 10/16/2007] [Revised: 11/20/2007] [Accepted: 01/04/2008] [Indexed: 11/18/2022]
Abstract
Structural aspects of protein-protein interactions provided by large-scale, genome-wide studies are essential for the description of life processes at the molecular level. A methodology is developed that applies the protein docking approach (GRAMM), based on the knowledge of experimentally determined protein-protein structures (DOCKGROUND resource) and properties of intermolecular energy landscapes, to genome-wide systems of protein interactions. The full sequence-to-structure-of-complex modeling pipeline is implemented in the Genome Wide Docking Database (GWIDD) resource. Protein interaction data are imported to GWIDD from external datasets of experimentally determined interaction networks. Essential information is extracted and unified to form the GWIDD database. Structures of individual interacting proteins in the database are retrieved (if available) or modeled, and protein complex structures are predicted by the docking program. All protein sequence, structure, and docking information is conveniently accessible through a Web interface.
Collapse
Affiliation(s)
- Zhengwei Zhu
- Center for Bioinformatics, The University of Kansas, 2030 Becker Drive, Lawrence, KS 66047, USA
| | | | | | | | | | | | | |
Collapse
|
14
|
Abstract
Decoys As the Reference State (DARS) is a simple and natural approach to the construction of structure-based intermolecular potentials. The idea is generating a large set of docked conformations with good shape complementarity but without accounting for atom types, and using the frequency of interactions extracted from these decoys as the reference state. In principle, the resulting potential is ideal for finding near-native conformations among structures obtained by docking, and can be combined with other energy terms to be used directly in docking calculations. We investigated the performance of various DARS versions for docking enzyme-inhibitor, antigen-antibody, and other type of complexes. For enzyme-inhibitor pairs, DARS provides both excellent discrimination and docking results, even with very small decoy sets. For antigen-antibody complexes, DARS is slightly better than a number of interaction potentials tested, but results are worse than for enzyme-inhibitor complexes. With a few exceptions, the DARS docking results are also good for the other complexes, despite poor discrimination, and we show that the latter is not a correct test for docking accuracy. The analysis of interactions in antigen-antibody pairs reveals that, in constructing pairwise potentials for such complexes, one should account for the asymmetry of hydrophobic patches on the two sides of the interface. Similar asymmetry does occur in the few other complexes with poor DARS docking results.
Collapse
|
15
|
Abstract
Studies of intermolecular energy landscapes are important for understanding protein association and adequate modeling of protein interactions. Landscape representation at different resolutions can be used for the refinement of docking predictions and detection of macro characteristics, like the binding funnel. A representative set of protein-protein complexes was used to systematically map the intermolecular landscape by grid-based docking. The change of the resolution was achieved by varying the range of the potential, according to the variable resolution GRAMM methodology. A formalism was developed to consistently parameterize the potential and describe essential characteristics of the landscape. The results of gradual landscape smoothing, from high to low resolution, indicate that i), the number of energy basins, the landscape ruggedness, and the slope decrease accordingly; ii), the number of near-native matches, defined as those inside the funnel, increases until the trend breaks down at critical resolution; the rate of the increase and the critical resolution are specific to the type of a complex (enzyme inhibitor, antigen-antibody, and other), reflect known underlying recognition factors, and correlate with earlier determined estimates of the funnel size; iii), the native/nonnative energy gap, a major characteristic of the energy minima hierarchy, remains constant; and iv), the putative funnel (defined as the deepest basin) has the largest average depth-related ruggedness and slope, at all resolutions. The results facilitate better understanding of the binding landscapes and suggest directions for implementation in practical docking protocols.
Collapse
|