Principles of flexible protein-protein docking.
Ontology highlight
ABSTRACT:
SUBMITTER: Andrusier N
PROVIDER: S-EPMC2574623 | biostudies-literature | 2008 Nov
REPOSITORIES: biostudies-literature
Publications
Principles of flexible protein-protein docking.
Andrusier Nelly N Mashiach Efrat E Nussinov Ruth R Wolfson Haim J HJ
Proteins 20081101 2
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 subseq ...[more]
Similar Datasets
Project description:MotivationBinding-induced conformational changes challenge current computational docking algorithms by exponentially increasing the conformational space to be explored. To restrict this search to relevant space, some computational docking algorithms exploit the inherent flexibility of the protein monomers to simulate conformational selection from pre-generated ensembles. As the ensemble size expands with increased flexibility, these methods struggle with efficiency and high false positive rates.ResultsHere, we develop and benchmark RosettaDock 4.0, which efficiently samples large conformational ensembles of flexible proteins and docks them using a novel, six-dimensional, coarse-grained score function. A strong discriminative ability allows an eight-fold higher enrichment of near-native candidate structures in the coarse-grained phase compared to RosettaDock 3.2. It adaptively samples 100 conformations each of the ligand and the receptor backbone while increasing computational time by only 20-80%. In local docking of a benchmark set of 88 proteins of varying degrees of flexibility, the expected success rate (defined as cases with ≥50% chance of achieving 3 near-native structures in the 5 top-ranked ones) for blind predictions after resampling is 77% for rigid complexes, 49% for moderately flexible complexes and 31% for highly flexible complexes. These success rates on flexible complexes are a substantial step forward from all existing methods. Additionally, for highly flexible proteins, we demonstrate that when a suitable conformer generation method exists, the method successfully docks the complex.Availability and implementationAs a part of the Rosetta software suite, RosettaDock 4.0 is available at https://www.rosettacommons.org to all non-commercial users for free and to commercial users for a fee.Supplementary informationSupplementary data are available at Bioinformatics online.
| S-EPMC6184633 | biostudies-literature
Project description:In this work, we validate and analyze the results of previously published cross docking experiments and classify failed dockings based on the conformational changes observed in the receptors. We show that a majority of failed experiments (i.e. 25 out of 33, involving four different receptors: cAPK, CDK2, Ricin and HIVp) are due to conformational changes in side chains near the active site. For these cases, we identify the side chains to be made flexible during docking calculation by superimposing receptors and analyzing steric overlap between various ligands and receptor side chains. We demonstrate that allowing these side chains to assume rotameric conformations enables the successful cross docking of 19 complexes (ligand all atom RMSD < 2.0 A) using our docking software FLIPDock. The number of side receptor side chains interacting with a ligand can vary according to the ligand's size and shape. Hence, when starting from a complex with a particular ligand one might have to extend the region of potential interacting side chains beyond the ones interacting with the known ligand. We discuss distance-based methods for selecting additional side chains in the neighborhood of the known active site. We show that while using the molecular surface to grow the neighborhood is more efficient than Euclidian-distance selection, the number of side chains selected by these methods often remains too large and additional methods for reducing their count are needed. Despite these difficulties, using geometric constraints obtained from the network of bonded and non-bonded interactions to rank residues and allowing the top ranked side chains to be flexible during docking makes 22 out of 25 complexes successful.
| S-EPMC4828239 | biostudies-literature
Project description:Conventional protein-protein docking algorithms usually rely on heavy candidate sampling and re-ranking, but these steps are time-consuming and hinder applications that require high-throughput complex structure prediction, e.g., structure-based virtual screening. Existing deep learning methods for protein-protein docking, despite being much faster, suffer from low docking success rates. In addition, they simplify the problem to assume no conformational changes within any protein upon binding (rigid docking). This assumption precludes applications when binding-induced conformational changes play a role, such as allosteric inhibition or docking from uncertain unbound model structures. To address these limitations, we present GeoDock, a multi-track iterative transformer network to predict a docked structure from separate docking partners. Unlike deep learning models for protein structure prediction that input multiple sequence alignments (MSAs), GeoDock inputs just the sequences and structures of the docking partners, which suits the tasks when the individual structures are given. GeoDock is flexible at the protein residue level, allowing the prediction of conformational changes upon binding. For a benchmark set of rigid targets, GeoDock obtains a 41% success rate, outperforming all the other tested methods. For a more challenging benchmark set of flexible targets, GeoDock achieves a similar number of top-model successes as the traditional method ClusPro [1], but fewer than ReplicaDock2 [2]. GeoDock attains an average inference speed of under one second on a single GPU, enabling its application in large-scale structure screening. Although binding-induced conformational changes are still a challenge owing to limited training and evaluation data, our architecture sets up the foundation to capture this backbone flexibility. Code and a demonstration Jupyter notebook are available at https://github.com/Graylab/GeoDock.
| S-EPMC10327054 | biostudies-literature
Project description:Molecular docking algorithms suggest possible structures for molecular complexes. They are used to model biological function and to discover potential ligands. A present challenge for docking algorithms is the treatment of molecular flexibility. Here, the rigid body program, DOCK, is modified to allow it to rapidly fit multiple conformations of ligands. Conformations of a given molecule are pre-calculated in the same frame of reference, so that each conformer shares a common rigid fragment with all other conformations. The ligand conformers are then docked together, as an ensemble, into a receptor binding site. This takes advantage of the redundancy present in differing conformers of the same molecule. The algorithm was tested using three organic ligand protein systems and two protein-protein systems. Both the bound and unbound conformations of the receptors were used. The ligand ensemble method found conformations that resembled those determined in X-ray crystal structures (RMS values typically less than 1.5 A). To test the method's usefulness for inhibitor discovery, multi-compound and multi-conformer databases were screened for compounds known to bind to dihydrofolate reductase and compounds known to bind to thymidylate synthase. In both cases, known inhibitors and substrates were identified in conformations resembling those observed experimentally. The ligand ensemble method was 100-fold faster than docking a single conformation at a time and was able to screen a database of over 34 million conformations from 117,000 molecules in one to four CPU days on a workstation.
| S-EPMC2143983 | biostudies-other
Project description:Protein-protein docking programs can give valuable insights into the structure of protein complexes in the absence of an experimental complex structure. Web interfaces can facilitate the use of docking programs by structural biologists. Here, we present an easy web interface for protein-protein docking with the ATTRACT program. While aimed at nonexpert users, the web interface still covers a considerable range of docking applications. The web interface supports systematic rigid-body protein docking with the ATTRACT coarse-grained force field, as well as various kinds of protein flexibility. The execution of a docking protocol takes up to a few hours on a standard desktop computer.
| S-EPMC4317529 | biostudies-literature
Project description:BackgroundThe problem of determining the physical conformation of a protein dimer, given the structures of the two interacting proteins in their unbound state, is a difficult one. The location of the docking interface is determined largely by geometric complementarity, but finding complementary geometry is complicated by the flexibility of the backbone and side-chains of both proteins. We seek to generate candidates for docking that approximate the bound state well, even in cases where there is backbone and/or side-chain difference from unbound to bound states.ResultsWe divide the surfaces of each protein into local patches and describe the effect of side-chain flexibility on each patch by sampling the space of conformations of its side-chains. Likely positions of individual side-chains are given by a rotamer library; this library is used to derive a sample of possible mutual conformations within the patch. We enforce broad coverage of torsion space. We control the size of the sample by using energy criteria to eliminate unlikely configurations, and by clustering similar configurations, resulting in 50 candidates for a patch, a manageable number for docking.ConclusionsUsing a database of protein dimers for which the bound and unbound structures of the monomers are known, we show that from the unbound patch we are able to generate candidates for docking that approximate the bound structure. In patches where backbone change is small (within 1 Å RMSD of bound), we are able to account for flexibility and generate candidates that are good approximations of the bound state (82% are within 1 Å and 98% are within 1.4 Å RMSD of the bound conformation). We also find that even in cases of moderate backbone flexibility our candidates are able to capture some of the overall shape change. Overall, in 650 of 700 test patches we produce a candidate that is either within 1 Å RMSD of the bound conformation or is closer to the bound state than the unbound is.
| S-EPMC3002368 | biostudies-literature
Project description:Accurate prediction of protein-DNA complexes could provide an important stepping stone towards a thorough comprehension of vital intracellular processes. Few attempts were made to tackle this issue, focusing on binding patch prediction, protein function classification and distance constraints-based docking. We introduce ParaDock: a novel ab initio protein-DNA docking algorithm. ParaDock combines short DNA fragments, which have been rigidly docked to the protein based on geometric complementarity, to create bent planar DNA molecules of arbitrary sequence. Our algorithm was tested on the bound and unbound targets of a protein-DNA benchmark comprised of 47 complexes. With neither addressing protein flexibility, nor applying any refinement procedure, CAPRI acceptable solutions were obtained among the 10 top ranked hypotheses in 83% of the bound complexes, and 70% of the unbound. Without requiring prior knowledge of DNA length and sequence, and within <2 h per target on a standard 2.0 GHz single processor CPU, ParaDock offers a fast ab initio docking solution.
| S-EPMC3203577 | biostudies-literature
Project description:Efficient and sufficient incorporation of protein flexibility into docking is still a challenging task. Docking to an ensemble of protein structures has proven its utility for docking, but using a large ensemble of structures can reduce the efficiency of docking and can increase the number of false positives in virtual screening. In this paper, we describe the application of our new methodology, Limoc, to generate an ensemble of holo-like protein structures in combination with the relaxed complex scheme (RCS), to virtual screening. We describe different schemes to reduce the ensemble of protein structures to increase efficiency and enrichment quality. Utilizing experimental knowledge about actives for a target protein allows the reduction of ensemble members to a minimum of three protein structures, increasing enrichment quality and efficiency simultaneously.
| S-EPMC3337782 | biostudies-literature
Project description:BackgroundMolecular docking simulation is the Rational Drug Design (RDD) step that investigates the affinity between protein receptors and ligands. Typically, molecular docking algorithms consider receptors as rigid bodies. Receptors are, however, intrinsically flexible in the cellular environment. The use of a time series of receptor conformations is an approach to explore its flexibility in molecular docking computer simulations, but it is extensively time-consuming. Hence, selection of the most promising conformations can accelerate docking experiments and, consequently, the RDD efforts.ResultsWe previously docked four ligands (NADH, TCL, PIF and ETH) to 3,100 conformations of the InhA receptor from M. tuberculosis. Based on the receptor residues-ligand distances we preprocessed all docking results to generate appropriate input to mine data. Data preprocessing was done by calculating the shortest interatomic distances between the ligand and the receptor's residues for each docking result. They were the predictive attributes. The target attribute was the estimated free-energy of binding (FEB) value calculated by the AutodDock3.0.5 software. The mining inputs were submitted to the M5P model tree algorithm. It resulted in short and understandable trees. On the basis of the correlation values, for NADH, TCL and PIF we obtained more than 95% correlation while for ETH, only about 60%. Post processing the generated model trees for each of its linear models (LMs), we calculated the average FEB for their associated instances. From these values we considered a LM as representative if its average FEB was smaller than or equal the average FEB of the test set. The instances in the selected LMs were considered the most promising snapshots. It totalized 1,521, 1,780, 2,085 and 902 snapshots, for NADH, TCL, PIF and ETH respectively.ConclusionsBy post processing the generated model trees we were able to propose a criterion of selection of linear models which, in turn, is capable of selecting a set of promising receptor conformations. As future work we intend to go further and use these results to elaborate a strategy to preprocess the receptors 3-D spatial conformation in order to predict FEB values. Besides, we intend to select other compounds, among the million catalogued, that may be promising as new drug candidates for our particular protein receptor target.
| S-EPMC3045799 | biostudies-literature
Project description:Many protein-protein interactions are mediated by a short linear motif. Usually, amino acid sequences of those motifs are known or can be predicted. It is much harder to experimentally characterize or predict their structure in the bound form. In this work, we test a possibility of using flexible docking of a short linear motif to predict the interaction interface of the EphB4-EphrinB2 complex (a system extensively studied for its significance in tumor progression).In the modeling, we only use knowledge about the motif sequence and experimental structures of EphB4-EphrinB2 complex partners. The proposed protocol enables efficient modeling of significant conformational changes in the short linear motif fragment during molecular docking simulation. For the docking simulations, we use the CABS-dock method for docking fully flexible peptides to flexible protein receptors (available as a server at http://biocomp.chem.uw.edu.pl/CABSdock/ ). Based on the docking result, the protein-protein complex is reconstructed and refined.Using this novel protocol, we obtained an accurate EphB4-EphrinB2 interaction model.The results show that the CABS-dock method may be useful as the primary docking tool in specific protein-protein docking cases similar to EphB4-EphrinB2 complex-that is, where a short linear motif fragment can be identified.
| S-EPMC5568603 | biostudies-literature