Macromolecular docking restrained by a small angle X-ray scattering profile

While many structures of single protein components are becoming available, structural characterization of their complexes remains challenging. Methods for modeling assembly structures from individual components frequently suffer from large errors, due to protein flexibility and inaccurate scoring functions. However, when additional information is available, it may be possible to reduce the errors and compute near-native complex structures. One such type of information is a small angle X-ray scattering (SAXS) profile that can be collected in a high-throughput fashion from a small amount of sample in solution. Here, we present an efficient method for protein–protein docking with a SAXS profile (FoXSDock): generation of complex models by rigid global docking with PatchDock, filtering of the models based on the SAXS profile, clustering of the models, and refining the interface by flexible docking with FireDock. FoXSDock is benchmarked on 124 protein complexes with simulated SAXS profiles, as well as on 6 complexes with experimentally determined SAXS profiles. When induced fit is less than 1.5 Å interface C_α RMSD and the fraction residues of missing from the component structures is less than 3%, FoXSDock can find a model close to the native structure within the top 10 predictions in 77% of the cases; in comparison, docking alone succeeds in only 34% of the cases. Thus, the integrative approach significantly improves on molecular docking alone. The improvement arises from an increased resolution of rigid docking sampling and more accurate scoring.     

Intuitive,but not simple: Including explicit water molecules in protein–protein docking simulations improves model quality

Characterizing the nature of interaction between proteins that have not been experimentally cocrystallized requires a computational docking approach that can successfully predict the spatial conformation adopted in the complex. In this work, the Hydropathic INTeractions (HINT) force field model was used for scoring docked models in a data set of 30 high‐resolution crystallographically characterized “dry” protein–protein complexes and was shown to reliably identify native‐like models. However, most current protein–protein docking algorithms fail to explicitly account for water molecules involved in bridging interactions that mediate and stabilize the association of the protein partners, so we used HINT to illuminate the physical and chemical properties of bridging waters and account for their energetic stabilizing contributions. The HINT water Relevance metric identified the “truly” bridging waters at the 30 protein–protein interfaces and we utilized them in “solvated” docking by manually inserting them into the input files for the rigid body ZDOCK program. By accounting for these interfacial waters, a statistically significant improvement of ～24% in the average hit‐count within the top‐10 predictions the protein–protein dataset was seen, compared to standard “dry” docking. The results also show scoring improvement, with medium and high accuracy models ranking much better than incorrect ones. These improvements can be attributed to the physical presence of water molecules that alter surface properties and better represent native shape and hydropathic complementarity between interacting partners, with concomitantly more accurate native‐like structure predictions. Proteins 2014; 82:916–932. © 2013 Wiley Periodicals, Inc.     

Optimized distance‐dependent atom‐pair‐based potential DOOP for protein structure prediction

The DOcking decoy‐based Optimized Potential (DOOP) energy function for protein structure prediction is based on empirical distance‐dependent atom‐pair interactions. To optimize the atom‐pair interactions, native protein structures are decomposed into polypeptide chain segments that correspond to structural motives involving complete secondary structure elements. They constitute near native ligand–receptor systems (or just pairs). Thus, a total of 8609 ligand–receptor systems were prepared from 954 selected proteins. For each of these hypothetical ligand–receptor systems, 1000 evenly sampled docking decoys with 0–10 Å interface root‐mean‐square‐deviation (iRMSD) were generated with a method used before for protein–protein docking. A neural network‐based optimization method was applied to derive the optimized energy parameters using these decoys so that the energy function mimics the funnel‐like energy landscape for the interaction between these hypothetical ligand–receptor systems. Thus, our method hierarchically models the overall funnel‐like energy landscape of native protein structures. The resulting energy function was tested on several commonly used decoy sets for native protein structure recognition and compared with other statistical potentials. In combination with a torsion potential term which describes the local conformational preference, the atom‐pair‐based potential outperforms other reported statistical energy functions in correct ranking of native protein structures for a variety of decoy sets. This is especially the case for the most challenging ROSETTA decoy set, although it does not take into account side chain orientation‐dependence explicitly. The DOOP energy function for protein structure prediction, the underlying database of protein structures with hypothetical ligand–receptor systems and their decoys are freely available at http://agknapp.chemie.fu‐berlin.de/doop/ . Proteins 2015; 83:881–890. © 2015 Wiley Periodicals, Inc.     

Multi-LZerD: multiple protein docking for asymmetric complexes

The tertiary structures of protein complexes provide a crucial insight about the molecular mechanisms that regulate their functions and assembly. However, solving protein complex structures by experimental methods is often more difficult than single protein structures. Here, we have developed a novel computational multiple protein docking algorithm, Multi‐LZerD, that builds models of multimeric complexes by effectively reusing pairwise docking predictions of component proteins. A genetic algorithm is applied to explore the conformational space followed by a structure refinement procedure. Benchmark on eleven hetero‐multimeric complexes resulted in near‐native conformations for all but one of them (a root mean square deviation smaller than 2.5Å). We also show that our method copes with unbound docking cases well, outperforming the methodology that can be directly compared with our approach. Multi‐LZerD was able to predict near‐native structures for multimeric complexes of various topologies.Proteins 2012; © 2012 Wiley Periodicals, Inc.     

BSP-SLIM: a blind low-resolution ligand-protein docking approach using predicted protein structures

We developed BSP‐SLIM, a new method for ligand–protein blind docking using low‐resolution protein structures. For a given sequence, protein structures are first predicted by I‐TASSER; putative ligand binding sites are transferred from holo‐template structures which are analogous to the I‐TASSER models; ligand–protein docking conformations are then constructed by shape and chemical match of ligand with the negative image of binding pockets. BSP‐SLIM was tested on 71 ligand–protein complexes from the Astex diverse set where the protein structures were predicted by I‐TASSER with an average RMSD 2.92 Å on the binding residues. Using I‐TASSER models, the median ligand RMSD of BSP‐SLIM docking is 3.99 Å which is 5.94 Å lower than that by AutoDock; the median binding‐site error by BSP‐SLIM is 1.77 Å which is 6.23 Å lower than that by AutoDock and 3.43 Å lower than that by LIGSITE^CSC. Compared to the models using crystal protein structures, the median ligand RMSD by BSP‐SLIM using I‐TASSER models increases by 0.87 Å, while that by AutoDock increases by 8.41 Å; the median binding‐site error by BSP‐SLIM increase by 0.69Å while that by AutoDock and LIGSITE^CSC increases by 7.31 Å and 1.41 Å, respectively. As case studies, BSP‐SLIM was used in virtual screening for six target proteins, which prioritized actives of 25% and 50% in the top 9.2% and 17% of the library on average, respectively. These results demonstrate the usefulness of the template‐based coarse‐grained algorithms in the low‐resolution ligand–protein docking and drug‐screening. An on‐line BSP‐SLIM server is freely available at http://zhanglab.ccmb.med.umich.edu/BSP‐SLIM . Proteins 2012. © 2011 Wiley Periodicals, Inc.     

DynaDock: A new molecular dynamics‐based algorithm for protein–peptide docking including receptor flexibility

Molecular docking programs play an important role in drug development and many well‐established methods exist. However, there are two situations for which the performance of most approaches is still not satisfactory, namely inclusion of receptor flexibility and docking of large, flexible ligands like peptides. In this publication a new approach is presented for docking peptides into flexible receptors. For this purpose a two step procedure was developed: first, the protein–peptide conformational space is scanned and approximate ligand poses are identified and second, the identified ligand poses are refined by a new molecular dynamics‐based method, optimized potential molecular dynamics (OPMD). The OPMD approach uses soft‐core potentials for the protein–peptide interactions and applies a new optimization scheme to the soft‐core potential. Comparison with refinement results obtained by conventional molecular dynamics and a soft‐core scaling approach shows significant improvements in the sampling capability for the OPMD method. Thus, the number of starting poses needed for successful refinement is much lower than for the other methods. The algorithm was evaluated on 15 protein–peptide complexes with 2–16mer peptides. Docking poses with peptide RMSD values <2.10 Å from the equilibrated experimental structures were obtained in all cases. For four systems docking into the unbound receptor structures was performed, leading to peptide RMSD values <2.12 Å. Using a specifically fitted scoring function in 11 of 15 cases the best scoring poses featured a peptide RMSD ≤2.10 Å. Proteins 2010. © 2009 Wiley‐Liss, Inc.     

Protein–protein structure prediction by scoring molecular dynamics trajectories of putative poses

The prediction of protein–protein interactions and their structural configuration remains a largely unsolved problem. Most of the algorithms aimed at finding the native conformation of a protein complex starting from the structure of its monomers are based on searching the structure corresponding to the global minimum of a suitable scoring function. However, protein complexes are often highly flexible, with mobile side chains and transient contacts due to thermal fluctuations. Flexibility can be neglected if one aims at finding quickly the approximate structure of the native complex, but may play a role in structure refinement, and in discriminating solutions characterized by similar scores. We here benchmark the capability of some state‐of‐the‐art scoring functions (BACH‐SixthSense, PIE/PISA and Rosetta) in discriminating finite‐temperature ensembles of structures corresponding to the native state and to non‐native configurations. We produce the ensembles by running thousands of molecular dynamics simulations in explicit solvent starting from poses generated by rigid docking and optimized in vacuum. We find that while Rosetta outperformed the other two scoring functions in scoring the structures in vacuum, BACH‐SixthSense and PIE/PISA perform better in distinguishing near‐native ensembles of structures generated by molecular dynamics in explicit solvent. Proteins 2016; 84:1312–1320. © 2016 Wiley Periodicals, Inc.     

Refining near‐native protein–protein docking decoys by local resampling and energy minimization

How to refine a near‐native structure to make it closer to its native conformation is an unsolved problem in protein‐structure and protein–protein complex‐structure prediction. In this article, we first test several scoring functions for selecting locally resampled near‐native protein–protein docking conformations and then propose a computationally efficient protocol for structure refinement via local resampling and energy minimization. The proposed method employs a statistical energy function based on a Distance‐scaled Ideal‐gas REference state (DFIRE) as an initial filter and an empirical energy function EMPIRE (EMpirical Protein‐InteRaction Energy) for optimization and re‐ranking. Significant improvement of final top‐1 ranked structures over initial near‐native structures is observed in the ZDOCK 2.3 decoy set for Benchmark 1.0 (74% whose global rmsd reduced by 0.5 Å or more and only 7% increased by 0.5 Å or more). Less significant improvement is observed for Benchmark 2.0 (38% versus 33%). Possible reasons are discussed. Proteins 2009. © 2008 Wiley‐Liss, Inc.     

Structural templates for comparative protein docking

Structural characterization of protein‐protein interactions is important for understanding life processes. Because of the inherent limitations of experimental techniques, such characterization requires computational approaches. Along with the traditional protein‐protein docking (free search for a match between two proteins), comparative (template‐based) modeling of protein‐protein complexes has been gaining popularity. Its development puts an emphasis on full and partial structural similarity between the target protein monomers and the protein‐protein complexes previously determined by experimental techniques (templates). The template‐based docking relies on the quality and diversity of the template set. We present a carefully curated, nonredundant library of templates containing 4950 full structures of binary complexes and 5936 protein‐protein interfaces extracted from the full structures at 12 Å distance cut‐off. Redundancy in the libraries was removed by clustering the PDB structures based on structural similarity. The value of the clustering threshold was determined from the analysis of the clusters and the docking performance on a benchmark set. High structural quality of the interfaces in the template and validation sets was achieved by automated procedures and manual curation. The library is included in the Dockground resource for molecular recognition studies at http://dockground.bioinformatics.ku.edu . Proteins 2015; 83:1563–1570. © 2014 Wiley Periodicals, Inc.     

Domain-Based Protein Docking with Extremely Large Conformational Changes

Proteins are key components in many processes in living cells, and physical interactions with other proteins and nucleic acids often form key parts of their functions. In many cases, large flexibility of proteins as they interact is key to their function. To understand the mechanisms of these processes, it is necessary to consider the 3D structures of such protein complexes. When such structures are not yet experimentally determined, protein docking has long been present to computationally generate useful structure models. However, protein docking has long had the limitation that the consideration of flexibility is usually limited to very small movements or very small structures. Methods have been developed which handle minor flexibility via normal mode or other structure sampling, but new methods are required to model ordered proteins which undergo large-scale conformational changes to elucidate their function at the molecular level. Here, we present Flex-LZerD, a framework for docking such complexes. Via partial assembly multidomain docking and an iterative normal mode analysis admitting curvilinear motions, we demonstrate the ability to model the assembly of a variety of protein–protein and protein-nucleic acid complexes.     

Protein models: The Grand Challenge of protein docking

Characterization of life processes at the molecular level requires structural details of protein–protein interactions (PPIs). The number of experimentally determined protein structures accounts only for a fraction of known proteins. This gap has to be bridged by modeling, typically using experimentally determined structures as templates to model related proteins. The fraction of experimentally determined PPI structures is even smaller than that for the individual proteins, due to a larger number of interactions than the number of individual proteins, and a greater difficulty of crystallizing protein–protein complexes. The approaches to structural modeling of PPI (docking) often have to rely on modeled structures of the interactors, especially in the case of large PPI networks. Structures of modeled proteins are typically less accurate than the ones determined by X‐ray crystallography or nuclear magnetic resonance. Thus the utility of approaches to dock these structures should be assessed by thorough benchmarking, specifically designed for protein models. To be credible, such benchmarking has to be based on carefully curated sets of structures with levels of distortion typical for modeled proteins. This article presents such a suite of models built for the benchmark set of the X‐ray structures from the Dockground resource ( http://dockground.bioinformatics.ku.edu ) by a combination of homology modeling and Nudged Elastic Band method. For each monomer, six models were generated with predefined C^α root mean square deviation from the native structure (1, 2, …, 6 Å). The sets and the accompanying data provide a comprehensive resource for the development of docking methodology for modeled proteins. Proteins 2014; 82:278–287. © 2013 Wiley Periodicals, Inc.     

Modeling protein–nucleic acid complexes with extremely large conformational changes using Flex-LZerD

Proteins and nucleic acids are key components in many processes in living cells, and interactions between proteins and nucleic acids are often crucial pathway components. In many cases, large flexibility of proteins as they interact with nucleic acids is key to their function. To understand the mechanisms of these processes, it is necessary to consider the 3D atomic structures of such protein–nucleic acid complexes. When such structures are not yet experimentally determined, protein docking can be used to computationally generate useful structure models. However, such docking has long had the limitation that the consideration of flexibility is usually limited to small movements or to small structures. We previously developed a method of flexible protein docking which could model ordered proteins which undergo large-scale conformational changes, which we also showed was compatible with nucleic acids. Here, we elaborate on the ability of that pipeline, Flex-LZerD, to model specifically interactions between proteins and nucleic acids, and demonstrate that Flex-LZerD can model more interactions and types of conformational change than previously shown.     

WHISCY: What information does surface conservation yield? Application to data‐driven docking

Protein-protein interactions play a key role in biological processes. Identifying the interacting residues is a first step toward understanding these interactions at a structural level. In this study, the interface prediction program WHISCY is presented. It combines surface conservation and structural information to predict protein-protein interfaces. The accuracy of the predictions is more than three times higher than a random prediction. These predictions have been combined with another interface prediction program, ProMate [Neuvirth et al. J Mol Biol 2004;338:181-199], resulting in an even more accurate predictor. The usefulness of the predictions was tested using the data-driven docking program HADDOCK [Dominguez et al. J Am Chem Soc 2003;125:1731-1737] in an unbound docking experiment, with the goal of generating as many near-native structures as possible. Unrefined rigid body docking solutions within 10 A ligand RMSD from the true structure were generated for 22 out of 25 docked complexes. For 18 complexes, more than 100 of the 8000 generated models were correct. Our results demonstrates the potential of using interface predictions to drive protein-protein docking.     

Toward high‐resolution homology modeling of antibody Fv regions and application to antibody–antigen docking

High‐resolution homology models are useful in structure‐based protein engineering applications, especially when a crystallographic structure is unavailable. Here, we report the development and implementation of RosettaAntibody, a protocol for homology modeling of antibody variable regions. The protocol combines comparative modeling of canonical complementarity determining region (CDR) loop conformations and de novo loop modeling of CDR H3 conformation with simultaneous optimization of V_L‐V_H rigid‐body orientation and CDR backbone and side‐chain conformations. The protocol was tested on a benchmark of 54 antibody crystal structures. The median root mean square deviation (rmsd) of the antigen binding pocket comprised of all the CDR residues was 1.5 Å with 80% of the targets having an rmsd lower than 2.0 Å. The median backbone heavy atom global rmsd of the CDR H3 loop prediction was 1.6, 1.9, 2.4, 3.1, and 6.0 Å for very short (4–6 residues), short (7–9), medium (10–11), long (12–14) and very long (17–22) loops, respectively. When the set of ten top‐scoring antibody homology models are used in local ensemble docking to antigen, a moderate‐to‐high accuracy docking prediction was achieved in seven of fifteen targets. This success in computational docking with high‐resolution homology models is encouraging, but challenges still remain in modeling antibody structures for sequences with long H3 loops. This first large‐scale antibody–antigen docking study using homology models reveals the level of “functional accuracy” of these structural models toward protein engineering applications. Proteins 2009; 74:497–514. © 2008 Wiley‐Liss, Inc.     

Minimal ensembles of side chain conformers for modeling protein–protein interactions

The goal of this article is to reduce the complexity of the side chain search within docking problems. We apply six methods of generating side chain conformers to unbound protein structures and determine their ability of obtaining the bound conformation in small ensembles of conformers. Methods are evaluated in terms of the positions of side chain end groups. Results for 68 protein complexes yield two important observations. First, the end‐group positions change less than 1 Å on association for over 60% of interface side chains. Thus, the unbound protein structure carries substantial information about the side chains in the bound state, and the inclusion of the unbound conformation into the ensemble of conformers is very beneficial. Second, considering each surface side chain separately in its protein environment, small ensembles of low‐energy states include the bound conformation for a large fraction of side chains. In particular, the ensemble consisting of the unbound conformation and the two highest probability predicted conformers includes the bound conformer with an accuracy of 1 Å for 78% of interface side chains. As more than 60% of the interface side chains have only one conformer and many others only a few, these ensembles of low‐energy states substantially reduce the complexity of side chain search in docking problems. This approach was already used for finding pockets in protein–protein interfaces that can bind small molecules to potentially disrupt protein–protein interactions. Side‐chain search with the reduced search space will also be incorporated into protein docking algorithms. Proteins 2012. © 2011 Wiley Periodicals, Inc.     

Protein-protein docking with multiple residue conformations and residue substitutions

The protein docking problem has two major aspects: sampling conformations and orientations, and scoring them for fit. To investigate the extent to which the protein docking problem may be attributed to the sampling of ligand side‐chain conformations, multiple conformations of multiple residues were calculated for the uncomplexed (unbound) structures of protein ligands. These ligand conformations were docked into both the complexed (bound) and unbound conformations of the cognate receptors, and their energies were evaluated using an atomistic potential function. The following questions were considered: (1) does the ensemble of precalculated ligand conformations contain a structure similar to the bound form of the ligand? (2) Can the large number of conformations that are calculated be efficiently docked into the receptors? (3) Can near‐native complexes be distinguished from non‐native complexes? Results from seven test systems suggest that the precalculated ensembles do include side‐chain conformations similar to those adopted in the experimental complexes. By assuming additivity among the side chains, the ensemble can be docked in less than 12 h on a desktop computer. These multiconformer dockings produce near‐native complexes and also non‐native complexes. When docked against the bound conformations of the receptors, the near‐native complexes of the unbound ligand were always distinguishable from the non‐native complexes. When docked against the unbound conformations of the receptors, the near‐native dockings could usually, but not always, be distinguished from the non‐native complexes. In every case, docking the unbound ligands with flexible side chains led to better energies and a better distinction between near‐native and non‐native fits. An extension of this algorithm allowed for docking multiple residue substitutions (mutants) in addition to multiple conformations. The rankings of the docked mutant proteins correlated with experimental binding affinities. These results suggest that sampling multiple residue conformations and residue substitutions of the unbound ligand contributes to, but does not fully provide, a solution to the protein docking problem. Conformational sampling allows a classical atomistic scoring function to be used; such a function may contribute to better selectivity between near‐native and non‐native complexes. Allowing for receptor flexibility may further extend these results.     

Towards the prediction of protein interaction partners using physical docking

Deciphering the whole network of protein interactions for a given proteome (‘interactome’) is the goal of many experimental and computational efforts in Systems Biology. Separately the prediction of the structure of protein complexes by docking methods is a well‐established scientific area. To date, docking programs have not been used to predict interaction partners. We provide a proof of principle for such an approach. Using a set of protein complexes representing known interactors in their unbound form, we show that a standard docking program can distinguish the true interactors from a background of 922 non‐redundant potential interactors. We additionally show that true interactions can be distinguished from non‐likely interacting proteins within the same structural family. Our approach may be put in the context of the proposed ‘funnel‐energy model’; the docking algorithm may not find the native complex, but it distinguishes binding partners because of the higher probability of favourable models compared with a collection of non‐binders. The potential exists to develop this proof of principle into new approaches for predicting interaction partners and reconstructing biological networks.