Wikipedia

Macromolecular docking

(Redirected from Protein-protein docking)

Macromolecular docking is the computational modelling of the quaternary structure of complexes formed by two or more interacting biological macromolecules. Protein–protein complexes are the most commonly attempted targets of such modelling, followed by protein–nucleic acid complexes.[1]

The ultimate goal of docking is the prediction of the three-dimensional structure of the macromolecular complex of interest as it would occur in a living organism. Docking itself only produces plausible candidate structures. These candidates must be ranked using methods such as scoring functions to identify structures that are most likely to occur in nature.

The term "docking" originated in the late 1970s, with a more restricted meaning; then, "docking" meant refining a model of a complex structure by optimizing the separation between the interactors but keeping their relative orientations fixed. Later, the relative orientations of the interacting partners in the modelling was allowed to vary, but the internal geometry of each of the partners was held fixed. This type of modelling is sometimes referred to as "rigid docking". With further increases in computational power, it became possible to model changes in internal geometry of the interacting partners that may occur when a complex is formed. This type of modelling is referred to as "flexible docking".

Background

edit

The biological roles of most proteins, as characterized by which other macromolecules they interact with, are known at best incompletely. Even those proteins that participate in a well-studied biological process (e.g., the Krebs cycle) may have unexpected interaction partners or functions which are unrelated to that process.

In cases of known protein–protein interactions, other questions arise. Genetic diseases (e.g., cystic fibrosis) are known to be caused by misfolded or mutated proteins, and there is a desire to understand what, if any, anomalous protein–protein interactions a given mutation can cause. In the distant future, proteins may be designed to perform biological functions, and a determination of the potential interactions of such proteins will be essential.

For any given set of proteins, the following questions may be of interest, from the point of view of technology or natural history:

If they do bind,

  • What is the spatial configuration which they adopt in their bound state?
  • How strong or weak is their interaction?

If they do not bind,

  • Can they be made to bind by inducing a mutation?

Protein–protein docking is ultimately envisaged to address all these issues. Furthermore, since docking methods can be based on purely physical principles, even proteins of unknown function (or which have been studied relatively little) may be docked. The only prerequisite is that their molecular structure has been either determined experimentally, or can be estimated by a protein structure prediction technique.

Protein–nucleic acid interactions feature prominently in the living cell. Transcription factors, which regulate gene expression, and polymerases, which catalyse replication, are composed of proteins, and the genetic material they interact with is composed of nucleic acids. Modeling protein–nucleic acid complexes presents some unique challenges, as described below.

History

edit

In the 1970s, complex modelling revolved around manually identifying features on the surfaces of the interactors, and interpreting the consequences for binding, function and activity; any computer programmes were typically used at the end of the modelling process, to discriminate between the relatively few configurations which remained after all the heuristic constraints had been imposed. The first use of computers was in a study on hemoglobin interaction in sickle-cell fibres.[2] This was followed in 1978 by work on the trypsin-BPTI complex.[3] Computers discriminated between good and bad models using a scoring function which rewarded large interface area, and pairs of molecules in contact but not occupying the same space. The computer used a simplified representation of the interacting proteins, with one interaction centre for each residue. Favorable electrostatic interactions, including hydrogen bonds, were identified by hand.[4]

In the early 1990s, more structures of complexes were determined, and available computational power had increased substantially. With the emergence of bioinformatics, the focus moved towards developing generalized techniques which could be applied to an arbitrary set of complexes at acceptable computational cost. The new methods were envisaged to apply even in the absence of phylogenetic or experimental clues; any specific prior knowledge could still be introduced at the stage of choosing between the highest ranking output models, or be framed as input if the algorithm catered for it. 1992 saw the publication of the correlation method,[5] an algorithm which used the fast Fourier transform to give a vastly improved scalability for evaluating coarse shape complementarity on rigid-body models. This was extended in 1997 to cover coarse electrostatics.[6]

In 1996 the results of the first blind trial were published,[7] in which six research groups attempted to predict the complexed structure of TEM-1 Beta-lactamase with Beta-lactamase inhibitor protein (BLIP). The exercise brought into focus the necessity of accommodating conformational change and the difficulty of discriminating between conformers. It also served as the prototype for the CAPRI assessment series, which debuted in 2001.[citation needed]

Rigid-body docking vs. flexible docking

edit

If the bond angles, bond lengths and torsion angles of the components are not modified at any stage of complex generation, it is known as rigid body docking. A subject of speculation is whether or not rigid-body docking is sufficiently good for most docking. When substantial conformational change occurs within the components at the time of complex formation, rigid-body docking is inadequate. However, scoring all possible conformational changes is prohibitively expensive in computer time. Docking procedures which permit conformational change, or flexible docking procedures, must intelligently select small subset of possible conformational changes for consideration.

Methods

edit

Successful docking requires two criteria:

  • Generating a set of configurations which reliably includes at least one nearly correct one.
  • Reliably distinguishing nearly correct configurations from the others.

For many interactions, the binding site is known on one or more of the proteins to be docked. This is the case for antibodies and for competitive inhibitors. In other cases, a binding site may be strongly suggested by mutagenic or phylogenetic evidence. Configurations where the proteins interpenetrate severely may also be ruled out a priori.

After making exclusions based on prior knowledge or stereochemical clash, the remaining space of possible complexed structures must be sampled exhaustively, evenly and with a sufficient coverage to guarantee a near hit. Each configuration must be scored with a measure that is capable of ranking a nearly correct structure above at least 100,000 alternatives. This is a computationally intensive task, and a variety of strategies have been developed.

Reciprocal space methods

edit

Each of the proteins may be represented as a simple cubic lattice. Then, for the class of scores which are discrete convolutions, configurations related to each other by translation of one protein by an exact lattice vector can all be scored almost simultaneously by applying the convolution theorem.[5] It is possible to construct reasonable, if approximate, convolution-like scoring functions representing both stereochemical and electrostatic fitness.

Reciprocal space methods have been used extensively for their ability to evaluate enormous numbers of configurations. They lose their speed advantage if torsional changes are introduced. Another drawback is that it is impossible to make efficient use of prior knowledge. The question also remains whether convolutions are too limited a class of scoring function to identify the best complex reliably.

Monte Carlo methods

edit

In Monte Carlo, an initial configuration is refined by taking random steps which are accepted or rejected based on their induced improvement in score (see the Metropolis criterion), until a certain number of steps have been tried. The assumption is that convergence to the best structure should occur from a large class of initial configurations, only one of which needs to be considered. Initial configurations may be sampled coarsely, and much computation time can be saved. Because of the difficulty of finding a scoring function which is both highly discriminating for the correct configuration and also converges to the correct configuration from a distance, the use of two levels of refinement, with different scoring functions, has been proposed.[8] Torsion can be introduced naturally to Monte Carlo as an additional property of each random move.

Monte Carlo methods are not guaranteed to search exhaustively, so that the best configuration may be missed even using a scoring function which would in theory identify it. How severe a problem this is for docking has not been firmly established.

Evaluation

edit

Scoring functions

edit
Main article: Scoring functions for docking

To find a score which forms a consistent basis for selecting the best configuration, studies are carried out on a standard benchmark (see below) of protein–protein interaction cases. Scoring functions are assessed on the rank they assign to the best structure (ideally the best structure should be ranked 1), and on their coverage (the proportion of the benchmark cases for which they achieve an acceptable result). Types of scores studied include:

It is usual to create hybrid scores by combining one or more categories above in a weighted sum whose weights are optimized on cases from the benchmark. To avoid bias, the benchmark cases used to optimize the weights must not overlap with the cases used to make the final test of the score.

The ultimate goal in protein–protein docking is to select the ideal ranking solution according to a scoring scheme that would also give an insight into the affinity of the complex. Such a development would drive in silico protein engineering, computer-aided drug design and/or high-throughput annotation of which proteins bind or not (annotation of interactome). Several scoring functions have been proposed for binding affinity / free energy prediction.[8][9][10][11][12] However the correlation between experimentally determined binding affinities and the predictions of nine commonly used scoring functions have been found to be nearly orthogonal (R2 ~ 0).[13] It was also observed that some components of the scoring algorithms may display better correlation to the experimental binding energies than the full score, suggesting that a significantly better performance might be obtained by combining the appropriate contributions from different scoring algorithms. Experimental methods for the determination of binding affinities are: surface plasmon resonance (SPR), Förster resonance energy transfer, radioligand-based techniques, isothermal titration calorimetry (ITC), microscale thermophoresis (MST) or spectroscopic measurements and other fluorescence techniques. Textual information from scientific articles can provide useful cues for scoring.[14]

Benchmarks

edit

A benchmark of 84 protein–protein interactions with known complexed structures has been developed for testing docking methods.[15] The set is chosen to cover a wide range of interaction types, and to avoid repeated features, such as the profile of interactors' structural families according to the SCOP database. Benchmark elements are classified into three levels of difficulty (the most difficult containing the largest change in backbone conformation). The protein–protein docking benchmark contains examples of enzyme-inhibitor, antigen-antibody and homomultimeric complexes.

The latest version of protein-protein docking benchmark consists of 230 complexes.[16] A protein-DNA docking benchmark consists of 47 test cases.[17] A protein-RNA docking benchmark was curated as a dataset of 45 non-redundant test cases[18] with complexes solved by X-ray crystallography only as well as an extended dataset of 71 test cases with structures derived from homology modelling as well.[19] The protein-RNA benchmark has been updated to include more structures solved by X-ray crystallography and now it consists of 126 test cases.[20] The benchmarks have a combined dataset of 209 complexes.[21]

A binding affinity benchmark has been based on the protein–protein docking benchmark.[13] 81 protein–protein complexes with known experimental affinities are included; these complexes span over 11 orders of magnitude in terms of affinity. Each entry of the benchmark includes several biochemical parameters associated with the experimental data, along with the method used to determine the affinity. This benchmark was used to assess the extent to which scoring functions could also predict affinities of macromolecular complexes.

This Benchmark was post-peer reviewed and significantly expanded.[22] The new set is diverse in terms of the biological functions it represents, with complexes that involve G-proteins and receptor extracellular domains, as well as antigen/antibody, enzyme/inhibitor, and enzyme/substrate complexes. It is also diverse in terms of the partners' affinity for each other, with Kd ranging between 10−5 and 10−14 M. Nine pairs of entries represent closely related complexes that have a similar structure, but a very different affinity, each pair comprising a cognate and a noncognate assembly. The unbound structures of the component proteins being available, conformation changes can be assessed. They are significant in most of the complexes, and large movements or disorder-to-order transitions are frequently observed. The set may be used to benchmark biophysical models aiming to relate affinity to structure in protein–protein interactions, taking into account the reactants and the conformation changes that accompany the association reaction, instead of just the final product.[22]

The CAPRI assessment

edit
Main article: Critical Assessment of PRediction of Interactions

The Critical Assessment of PRediction of Interactions[23] is an ongoing series of events in which researchers throughout the community try to dock the same proteins, as provided by the assessors. Rounds take place approximately every 6 months. Each round contains between one and six target protein–protein complexes whose structures have been recently determined experimentally. The coordinates and are held privately by the assessors, with the cooperation of the structural biologists who determined them. The assessment of submissions is double blind.

CAPRI attracts a high level of participation (37 groups participated worldwide in round seven) and a high level of interest from the biological community in general. Although CAPRI results are of little statistical significance owing to the small number of targets in each round, the role of CAPRI in stimulating discourse is significant. (The CASP assessment is a similar exercise in the field of protein structure prediction).

See also

edit

References

edit
  1. ^ Yousif, Ragheed Hussam, et al. "Exploring the Molecular Interactions between Neoculin and the Human Sweet Taste Receptors through Computational Approaches." Sains Malaysiana 49.3 (2020): 517-525.
  2. ^ Levinthal C, Wodak SJ, Kahn P, Dadivanian AK (1975). "Hemoglobin Interactions in Sickle Cell Fibers: I. Theoretical Approaches to the Molecular Contacts". Proceedings of the National Academy of Sciences. 72 (4): 1330–1334. Bibcode:1975PNAS...72.1330L. doi:10.1073/pnas.72.4.1330. PMC 432527. PMID 1055409.
  3. ^ Wodak SJ, Janin J (1978). "Computer Analysis of Protein-Protein Interactions". Journal of Molecular Biology. 124 (2): 323–342. doi:10.1016/0022-2836(78)90302-9. PMID 712840.
  4. ^ Wodak SJ, De Crombrugghe M, Janin J (1987). "Computer Studies of Interactions between Macromolecules". Progress in Biophysics and Molecular Biology. 49 (1): 29–63. doi:10.1016/0079-6107(87)90008-3. PMID 3310103.
  5. ^ a b Katchalski-Katzir E, Shariv I, Eisenstein M, Friesem AA, Aflalo C, Vakser IA (1992). "Molecular surface recognition: determination of geometric fit between proteins and their ligands by correlation techniques". Proc. Natl. Acad. Sci. U.S.A. 89 (6): 2195–2199. Bibcode:1992PNAS...89.2195K. doi:10.1073/pnas.89.6.2195. PMC 48623. PMID 1549581.
  6. ^ Gabb HA, Jackson RM, Sternberg MJ (September 1997). "Modelling protein docking using shape complementarity, electrostatics and biochemical information". J. Mol. Biol. 272 (1): 106–120. doi:10.1006/jmbi.1997.1203. PMID 9299341.
  7. ^ Strynadka NC, Eisenstein M, Katchalski-Katzir E, Shoichet BK, Kuntz ID, Abagyan R, Totrov M, Janin J, Cherfils J, Zimmerman F, Olson A, Duncan B, Rao M, Jackson R, Sternberg M, James MN (1996). "Molecular Docking Programs Successfully Predict the Binding of a Beta-lactamase Inhibitory Protein to TEM-1 Beta-Lactamase". Nature Structural & Molecular Biology. 3 (3): 233–239. doi:10.1038/nsb0396-233. PMID 8605624. S2CID 40212654.
  8. ^ a b Gray JJ, Moughon S, Wang C, Schueler-Furman O, Kuhlman B, Rohl CA, Baker D (2003). "Protein–protein docking with simultaneous optimization of rigid-body displacement and side-chain conformations". J. Mol. Biol. 331 (1): 281–299. doi:10.1016/S0022-2836(03)00670-3. PMID 12875852.
  9. ^ Camacho CJ, Vajda S (2008). "Protein docking along smooth association pathways". Proceedings of the National Academy of Sciences. 98 (19): 10636–10641. doi:10.1073/pnas.181147798. PMC 58518. PMID 11517309.
  10. ^ Camacho CJ, Vajda S (2007). "In silico screening of mutational effects on enzyme-proteic inhibitor affinity: a docking-based approach". BMC Structural Biology. 7: 37. doi:10.1186/1472-6807-7-37. PMC 1913526. PMID 17559675.
  11. ^ Zhang C, Liu S, Zhu Q, Zhou Y (2005). "A knowledge-based energy function for protein–ligand, protein–protein, and protein–DNA complexes". Journal of Medicinal Chemistry. 48 (7): 2325–2335. doi:10.1021/jm049314d. PMID 15801826.
  12. ^ Esmaielbeiki R, Nebel JC (2014). "Scoring docking conformations using predicted protein interfaces". BMC Bioinformatics. 15: 171. doi:10.1186/1471-2105-15-171. PMC 4057934. PMID 24906633.
  13. ^ a b Kastritis PL, Bonvin AM (May 2010). "Are scoring functions in protein–protein docking ready to predict interactomes? Clues from a novel binding affinity benchmark". J. Proteome Res. 9 (5): 2216–2225. doi:10.1021/pr9009854. hdl:1874/202590. PMID 20329755.
  14. ^ Badal, VD, Kundrotas, PJ, Vakser, IA (2018). "Natural language processing in text mining for structural modeling of protein complexes". BMC Bioinformatics. 19 (1): 84. doi:10.1186/s12859-018-2079-4. PMC 5838950. PMID 29506465.
  15. ^ Mintseris J, Wiehe K, Pierce B, Anderson R, Chen R, Janin J, Weng Z (2005). "Protein-Protein Docking Benchmark 2.0: an update". Proteins. 60 (2): 214–216. doi:10.1002/prot.20560. PMID 15981264. S2CID 24049376.
  16. ^ Vreven T, Moal IH, Vangone A, Pierce BG, Kastritis PL, Torchala M, Chaleil R, Jiménez-García B, Bates PA, Fernandez-Recio J, Bonvin AM, Weng Z (September 2015). "Updates to the Integrated Protein-Protein Interaction Benchmarks: Docking Benchmark Version 5 and Affinity Benchmark Version 2". Journal of Molecular Biology. 427 (19): 3031–41. doi:10.1016/j.jmb.2015.07.016. PMC 4677049. PMID 26231283.
  17. ^ van Dijk M, Bonvin AM (August 2008). "A protein-DNA docking benchmark". Nucleic Acids Research. 36 (14): e88. doi:10.1093/nar/gkn386. PMC 2504314. PMID 18583363.
  18. ^ Barik A, C N, P M, Bahadur RP (July 2012). "A protein-RNA docking benchmark (I): nonredundant cases". Proteins. 80 (7): 1866–71. doi:10.1002/prot.24083. PMID 22488669. S2CID 437472.
  19. ^ Pérez-Cano L, Jiménez-García B, Fernández-Recio J (July 2012). "A protein-RNA docking benchmark (II): extended set from experimental and homology modeling data". Proteins. 80 (7): 1872–82. doi:10.1002/prot.24075. PMID 22488990. S2CID 20322388.
  20. ^ Nithin C, Mukherjee S, Bahadur RP (November 2016). "A non-redundant protein-RNA docking benchmark version 2.0". Proteins. 85 (2): 256–267. doi:10.1002/prot.25211. PMID 27862282. S2CID 26814049.
  21. ^ Nithin, Chandran; Ghosh, Pritha; Bujnicki, Janusz; Nithin, Chandran; Ghosh, Pritha; Bujnicki, Janusz M. (2018-08-25). "Bioinformatics Tools and Benchmarks for Computational Docking and 3D Structure Prediction of RNA-Protein Complexes". Genes. 9 (9): 432. doi:10.3390/genes9090432. PMC 6162694. PMID 30149645.
  22. ^ a b Kastritis PL, Moal IH, Hwang H, Weng Z, Bates PA, Bonvin AM, Janin J (March 2011). "A structure-based benchmark for protein-protein binding affinity". Protein Science. 20 (3): 482–491. doi:10.1002/pro.580. PMC 3064828. PMID 21213247.
  23. ^ Janin J, Henrick K, Moult J, Eyck LT, Sternberg MJ, Vajda S, Vakser I, Wodak SJ (2003). "CAPRI: a Critical Assessment of PRedicted Interactions". Proteins. 52 (1): 2–9. CiteSeerX 10.1.1.461.3355. doi:10.1002/prot.10381. PMID 12784359. S2CID 31489448.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Macromolecular_docking&oldid=1250285764"