- freely available
Int. J. Mol. Sci. 2011, 12(2), 1316-1333; doi:10.3390/ijms12021316
Published: 22 February 2011
Abstract: Rapid progress of theoretical methods and computer calculation resources has turned in silico methods into a conceivable tool to predict the 3D structure of macromolecular assemblages, starting from the structure of their separate elements. Still, some classes of complexes represent a real challenge for macromolecular docking methods. In these complexes, protein parts like loops or domains undergo large amplitude deformations upon association, thus remodeling the surface accessible to the partner protein or DNA. We discuss the problems linked with managing such rearrangements in docking methods and we review strategies that are presently being explored, as well as their limitations and success.
Macromolecular docking methods aim at predicting the three-dimensional (3D) structure of protein-protein or protein-DNA complexes starting from the coordinates of their components taken in a so-called unbound form. The unbound form may come from the structural databank PDB, in which case it represents the structure of the component alone or in association with another partner. It can also be reconstructed from proteins with homologous sequences and known structure.
In the post-genomic context, docking methods are being developed as a complement to experimental approaches, in order to determine the structure of the macromolecular assemblies that rule the cell life. Knowing the 3D structure of complexes involved in biological processes is necessary for unraveling the mechanism of these processes. In addition, it opens the way to the discovery of new drugs that will enhance or hinder the association. For example, commonly used antibiotics like streptomycin or erythromycin disturb the interactions between ribosome subunits and messenger or transfer RNA of bacteria. In that way protein synthesis is interrupted, which is lethal to the bacteria.
However, a great part of the macromolecular complexes fall out of the reach of experimental methods for high resolution structure resolution, such as X-ray crystallography or nuclear magnetic resonance (NMR). This may be due to their size or to their instability. Besides, the huge number of putative or known complexes involved in biological processes renders necessary the conjunction between structural biology and theoretical tools, provided that the latter reach sufficient levels of accuracy and rapidity. This creates high expectation for the development of macromolecular docking methods.
The field has rapidly progressed since the first docking attempts were performed in 1978 , as testified by the results of the CAPRI experiment [2–7]. CAPRI (Critical Assessment of PRotein Interactions, http://www.ebi.ac.uk/msd-srv/capri) challenges modeling groups, involved in the development of macromolecular docking programs, to predict the structure of protein-protein or protein-nucleic acid complexes. The target complexes have experimentally determined but yet unreleased 3D structure. Evaluation is performed on a common basis and the disclosed successes or failures permit to delineate the methodological issues that can be considered solved and those that still need to be improved. The nearly ten years and already twenty three CAPRI rounds have testified increasing quality of the predicted complex structures in spite of the increasing difficulty of the prediction targets.
Issues related to general macromolecular docking methods or flexible docking have been reviewed in full detail in several highly interesting publications [8–14]. The present contribution focuses on cases where the docking methods still fail to predict the correct geometry of the complex, or at least where potential success cannot be anticipated with certainty. Such cases most frequently occur when the interface of at least one of the partner proteins largely differs between its bound and its unbound forms. This corresponds to situations where the surface that eventually will bind the partner gets remodelled during association (Figure 1), in a process referred to as induced fit. In these cases, neglecting the flexibility during the first phases of the docking simulation can result in the near-native geometry of association not even being sampled. The review first presents the methodological issues associated with taking flexibility into account during docking simulations, followed by an overview of the current knowledge on protein flexibility. Finally, the principal strategies for flexible docking are detailed, with a particular emphasis on the methods aiming at predicting high amplitude conformational changes during macromolecular assembly.
2. The Flexible Docking Problem
Typical docking protocols are composed of three ingredients: a representation for the macromolecules (resolution, degrees of freedom for conformational space exploration), a method for searching the available conformational space and a scoring function able to distinguish the correct solution from every other generated structure of the complex.
Searching the possible geometries of binary protein-protein complexes requires the exploration of at least six degrees of freedom, three translations and three rotations. This level of exploration is sufficient as long as the structural modifications of each partner that accompany their association are of limited amplitude (movements of short side-chains, low amplitude deformations of the backbone). The use of low resolution representation with smooth interface, tolerating a certain degree of interpenetration, can then implicitly account for these changes. It is assumed that the protein will eventually perform the small amplitude interface rearrangement that is necessary to optimize the steric and electrostatic complementarity at the interface. As a matter of fact, recent docking programs often follow this assumption in the first phase of a multi-stage strategy . The protein representation can then consist of surface descriptors , discretized representations [18,19] or rigid coarse grain models [20,21]. It is accompanied by crude scoring functions, like statistical potential for amino acid-amino acid interaction , grid-based estimation of surface contacts [19,22], interaction energy terms limited to electrostatics and van der Waals . At this stage of the docking process, detailed steric complementarity is not necessary for the geometry (position/orientation) of the complex to be considered for further refinement. As a result, while the low resolution search eliminates a huge part of possible geometries of association, it often generates many false positive solutions, i.e., highly ranked predicted structures that are distinct from the near native structure. Recent evaluation showed that for cases with limited overall partner flexibility, when geometries close to the native complex structure pass the first phase, they can be distinguished from the false positive solutions during the second stage, i.e., when small amplitude deformations of the main chain and side chains are explicitly explored [21–27]. In what follows, we will refer to that stage as flexible refinement.
The nature of the problem completely changes when the interface of one component protein gets remodeled during association. The interacting surface may become partially or totally unaccessible to its partner when the protein is in the unbound form. Such cases represent about a quarter of the CAPRI prediction targets and a fifth of non-redundant protein-protein complexes with known unbound form of the interaction partners (benchmark 4.0, ). In extreme situations, the spatial arrangement of amino acids characterizing the interface only forms when a loop refolds or when a domain modifies its position or orientation. It is therefore impossible to detect the correct association geometry during a rigid body search phase, even when working at low resolution or with a smooth interface. In addition, even if a geometry close to the native one is retained by chance in spite of incorrect interface, it cannot be expected to be improved during the refinement phase. As already mentioned, the refinement phase generally introduces spatial limitation for the relative position/orientation of the two partners, while the route towards the correct geometry of association would necessitate the separation of the partners to allow loop refolding or domain repositioning. Such cases can only be solved if flexibility is considered from the beginning of the docking process.
This formally transforms a search problem with six degrees of freedom into a search problem with 3N degrees of freedom, where N represents the total number of atoms in the system. The presently available computer resources can account for such high number of degrees of freedom, for example during numerical MD simulations, but the conformational space explored by these simulations is limited by the simulation time. Since the largest amplitude internal moves are also those that take more time to be sampled, such methods appear unsuitable to the docking search problem, which requires high velocity. This makes it necessary to reduce the search dimensionality. Section 3 displays the strategies that have been developed to address this challenge, based on the growing knowledge of the characteristics of protein flexibility. It is useful to present some elements of this knowledge for the understanding of flexible search strategies, and this is done in Section 2.2.
2.1. Flexible Refinement
What characterizes the flexible refinement stage is that it deals with already formed complex structures resulting from the search stage of docking. The process then allows only small spatial adjustments of the global geometry in terms of the six rigid body degrees of freedom. It concentrates on the explicit account of internal degrees of freedom that are responsible for surface adjustments. The spatial limitation of the search together with the fact that the number of refined structures is reduced with respect to the first phase of exhaustive search make it possible to introduce some degree of internal flexibility in the exploration. The task remains however difficult. Searching the side chain conformations that optimize the interface is computationally expensive for protein-protein complexes, where the interfaces of both partners need to be simultaneously optimized in combination with small amplitude rigid body adjustments. Side chain rotamer libraries, gathering the conformations most frequently found in known protein structures, can be used with benefit in the process . While the conformation of particular side chains in the bound form does not necessarily coincide with a rotamer, the use of discrete side chain representations can be justified in preliminary search phases. The group of Camacho has shown for 39 protein test cases that the bound conformation of key side chains is frequently visited during molecular dynamics simulations of the free form of the protein. [30,31]. Sophisticated algorithms have been developed for predicting the rotamer combinations that best fit a fixed backbone. However, when searching rotamer libraries in conjunction with backbone repositioning in docking programs, it is convenient to use Monte Carlo simulations, which are also well adapted to directly sampling the dihedral angles in internal variable representation [21,22,32]. The use of molecular dynamics (MD) simulation for side chain final refinement, sometimes with explicit solvent representation, is now commonly encountered due to increased computational facilities.
Protein backbone refinement has been introduced only recently in the systematic docking programs. It is however at the heart of the information-driven docking program HADDOCK developed by the group of Bonvin [33,34]. This program initially performs a rough positioning of the two partners relative to each other, based on the satisfaction of a set of interaction restraints derived from experimental data (NMR, biochemical data). A particularity of the method is that the restraints are not attributed to specific residue pairs, with each residue belonging to a different partner, but rather that they concern pre-defined groups of residues for each partner, hence the term “ambiguous restraints”. After these restraints are satisfied, the protocol can concentrate on the refinement stage, which is performed in two steps, first using MD simulations in internal coordinates with side chain and backbone flexibility limited to the interface regions, then using cartesian coordinate MD simulations in explicit solvent environment.
With the progress of computational performance and algorithmic development, methods that combine side chain conformational search, ligand repositioning and main chain limited structural adjustment are emerging [24,35,36]. Erlich et al.  have emphasized the necessity of simultaneously taking into account these three levels of conformational search or adjustment to achieve successful docking refinement.
2.2. Characteristics of Protein Flexibility
Although proteins are generally characterized by well defined tertiary structures, they undergo structural fluctuations at biologically relevant temperatures. Part of these movements can be described by high frequency, small amplitude fluctuations of the atoms around their equilibrium position (harmonic fluctuations). However, a large part of the movements (up to 80%) can be accounted for by a few modes of deformation that involve concerted atomic motions. Such directions of deformation can be accessed by several methods, including normal mode analysis or principal component analysis of structural ensembles . For example, Dobbins et al.  have shown that in 35% of the proteins they studied, the direction of the observed conformational change could be correctly described by a single low-frequency normal mode. The ensembles may be composed of MD snapshots or structures obtained in different conditions and environments by X-ray crystallography or NMR.
Large amplitude fluctuations of protein structures often present biological importance. They have been shown in various occasions to play a role in catalytic reactions, in molecular assembly or in specific ligand recognition. Concerted movements can present a strong harmonic character, generally with low frequency fluctuations. In this case, they can be addressed by simple analytic functions during docking calculations, as shown in the next section. Alternatively, when the concerted movements involve main chain refolding, the protein structure explores various conformational substates separated by energy barriers with small to large amplitudes. Generating and exploring these substates then becomes highly time consuming, which is not compatible with a docking search process. In those cases, it is useful to consider another characteristic of protein flexibility, which is its anisotropy. At the residue level, protein display large variations in fluctuation amplitudes [40,41]. Interestingly, Sacquin-Mora and Lavery [42,43] have shown that among the residues that present high degrees of rigidity, several are key residues involved in catalytic activity or in the stabilization of the overall 3D structure. Rigid residues can also be found at the frontier between domains or at the extremity of loops, where they constitute hinge points between protein regions. As a matter of fact, interface remodeling in interacting protein most often results from the movement of loops or domains that move independently from an almost rigid protein core. For the proteins that fall in this category, it is possible to restrain the search to the flexible regions during the docking search phase, as shown in the next section. Several web servers are devoted to the detection of flexible protein segments that may be involved in interface remodeling during docking. ElNemo  (http://www.igs.cnrs-mrs.fr/elnemo/) and HingeProt  (http://bioinfo3d.cs.tau.ac.il/HingeProt/hingeprot.html) are based on the analysis of low frequency normal modes calculated from elastic networks, while ProFlex  (http://www.bch.msu.edu/kuhn/software/proflex/) relies on a three-dimensional constraint counting algorithm. StoneHinge  is a consensus method between the two approaches.
The two types of deformation that have been described above can be put in correspondence with two complementary views of protein structural adjustments upon interaction. In the induced-fit interpretation, the protein modifies its internal conformation due to its exposition to the field of its partner . In the structural ensemble interpretation, all conformational substates a protein can occupy coexist in solution, and the partner will select the substate that allows optimal surface fit .
3. Methods for Flexible Docking Search
Based on the protein deformation characteristics described above and on the different views of the docking process, several strategies have been developed to deal with flexibility from the beginning of the docking process. In what follows, the term “continuous approach” will refer to strategies where the molecule gradually deforms to fit its partner. To the contrary “discrete approaches” refer to strategies where each molecule selects the best fitting conformation among ensembles of substates (or conformers) that represent its partner.
3.1. Continuous Approaches
3.1.1. Soft Mode Relaxation
A first strategy is to introduce concerted movements as additional degrees of freedom during the search phase. As explained above, introducing full internal flexibility during the search would be intractable, given the objective of rapidity and efficiency. However, when the movement can be described by harmonic approximation, the largest amplitude conformational changes only require a few selected modes of deformation. Restricting the search to this few modes permits to reduce the dimensionality of the problem. Indeed, the group of Zacharias has shown that the use of only three modes could drastically improve the docking result between RNAse A and its porcine inhibitor . In that work, exploration is performed using the docking program ATTRACT with reduced protein representation . The program bases the search on a multi-minimization algorithm. In the rigid body version, the interaction energy between a mobile ligand (the smallest of the two partners) and a fixed receptor is optimized with respect to six degrees of freedom. In the flexible version, the selected collective variables are added as new degrees of freedom, with an associated potential energy E(x) α (x − x0)4, where E(x) is the energetic penalty term associated to the deviation (x − x0) of the collective variable x with respect to its starting value x0. In this expression, the power four allows confinement of the collective variable to values where it retains its harmonic character, thus avoiding the generation of unphysical structural deformations.
The soft mode relaxation method therefore offers the potentiality to reduce the computational complexity at low calculation cost.
3.2. Discrete Approaches
Several groups have investigated an approach of flexibility where predefined ensembles of conformers are cross-docked, i.e., each conformer of one partner is successively docked with each conformer of the other partner. The ensembles can be constructed from conformations available in databanks, for example as a result of NMR structure determination. More generally, they can be constructed from essential or enhanced MD simulations [50–53]. The numerous complex structures resulting from cross docking are then clusterized and ranked. All reported cross-docking experiments generated clusters of solutions closer to the correct complex structure than the equivalent rigid body docking starting from the unbound form. However, these structures did not necessarily rank among the 10 clusters with best scores and many false positive were also generated. Due to their calculation cost, cross-docking experiments were initially used to investigate the thermodynamics and kinetic driving forces of the protein-protein assembly process . The impressive progress in docking program velocity permits to conceive cross-docking as a routine process for flexible docking .
3.2.2. Interface Remodeling
The particularities of protein flexibility permit to more specifically restrain the search to movements of flexible fragments, either loops or domains, while representing the rest of the protein as a rigid body with smooth interface. In addition to sparing calculation time, spatial limitation permits to enhance the exploration of the flexible fragments and to access totally anharmonic moves such as loop refolding or domain rearrangement. This implies preliminary detection of the flexible fragments, as already reported in Section 2.2. Since in the ensemble-based approaches the loop conformers are pre-generated, large exploration methods like robotics  or alphabet-based analysis  can be called in the preparation phase, particularly in the case of long loops (more than 12 amino acids) that remain a real challenge for modelling methods. The particular problem of protein loop structure determination is recurrent in the molecular modeling literature. Flexible loops are common at protein surfaces and the sequence difference between two homologous proteins often concentrates on such fragments, in association with variations in function. Useful articles reporting on the loop prediction methods can be found in references [57,58]. Note that the major part of these methods aim at predicting only the lowest energy conformations, while accounting for loop conformational changes requires the access to every possible conformational substate.
3.2.3. Multi-Copy/Mean Field Approach
Bastard et al. [32,59] have shown that when using loop ensembles that cover the whole volume accessible to a flexible loop, it is possible to improve the prediction of both the relative arrangement of the partners and the loop geometry through a unique docking simulation. For this purpose, the flexible loop was taken into account via the mean field theory: each substate (copy) is attributed a weight which is iteratively adjusted during the docking process, depending on the interaction energy between the copy and the partner of association. In that way, the best interacting copies are attributed the highest weight, which in turn increases their influence in the docking process.
The method has been successfully coupled to two search methods: Monte Carlo simulations and minimization. Monte Carlo search was used for protein-DNA docking in all atom representation with the MC2 program . In this study featuring a paired domain and its target oligonucleotide, the copy weights of a copy ensemble comprising 66 loop conformers were readjusted at the end of each of five runs of a Monte Carlo simulated annealing cycle, in function of the mean interaction energy observed during that cycle. In spite of the high amplitude allowed for loop movements, this first application of the multi-copy/mean field method more specifically resorts to refinement docking: the search space was restrained to the vicinity of the flexible loop, the search was performed in atomic representation and resulted in the reproduction of the atomic details of the native interface. The minimization-based ATTRACT application of the multi-copy/mean field algorithm illustrates the introduction of flexibility from the beginning of the search phase of a systematic docking procedure. For this reason, we will rather center the discussion on that application. In this case, the number of copies representing the flexible fragment is reduced due to the coarse-grained representation. The copy weights directly influence the energy minimization process by entering in the calculation of the energy derivative . The use of the multi-copy/mean field method for systematic docking was first tested on a set of eight protein/protein complexes where one or two loops present important conformational changes between the bound and the unbound form of one partner . When the correct loop conformation was present among the copy ensemble, the correct arrangement of the partners and the correct loop conformation could be unambiguously predicted. When it was not, the ranking of solutions close to the complex geometry was improved in all cases, together with the population of corresponding clusters of solutions.
Several issues have been further investigated to evaluate the possible use of the method in general blind docking predictions (unpublished results). It was found that the method can successfully apply to systems with more than one flexible part (see Figures 2 and 3), to systems where the flexible fragment occupies an important fraction of the structure (30% for CDK2-cyclin complex, PDB code 1FIN) or where it can span a large accessible volume (α-β, γ subunits of transducin, PDB code 1GOT). For both cases 1FIN (Figure 2) and 1GOT (Figure 3), when the correct conformation was present in the copy ensemble, the algorithm ranked first solutions close to the native complex structure and correctly selected the bound forms for both the loop and the domain. Figure 3B shows two structures corresponding to two different clusters of solutions, a solution close to the experimental complex (left) and an alternative positioning of the ligand, favored by a different orientation of the helix in yellow (right). The energy score clearly discriminates the near-native structures from other potential solutions.
Tolerance of the method to structural inaccuracies was investigated in the case of the flexible helix of 1GOT. When the crystal helix position was absent from the conformer ensemble, and ab initio constructed helices were superposed on each of the nine remaining copies, the closest copy (5Å deviation on Cα atoms) did not favor the correct positioning of the ligand. In the simulation displayed in Figure 4B (left), the best ranking solutions present a correct positioning, but with a selected helix conformation deviating by 21Å from the crystal helix. When the closest copy deviated by 1Å from the crystal instead of 5Å, it displaced the 21Å copy and was selected in near-native solutions with improved interaction energy (Figure 4B, right).
Combined together, these results raise two issues: the first one concerns the quality of the conformer ensemble (spatial density and extent) that is necessary to reach an accurate prediction. To our knowledge, this issue has not been extensively investigated in the cross-docking studies. It has been addressed in the case of the multi-copy/mean field approach of loop flexibility by Loriot et al.. . In this work, the spatial density of the conformers in the multi-copy ensemble was optimized using a greedy algorithm, in order to span the whole space available to the loop with the minimum number of conformers. Spatial dispersion of the conformers is an important factor in this method since local conformer accumulation may bias the mean field resulting from the copy ensemble. In the four tested protein-protein cases, it was found that total coverage of the available space could be achieved using ten to twenty copies.
The second issue addresses the methodological problem of interface “reconstitution” from two or more structural elements. As illustrated in Figure 3, highly ranked solutions resulting from the multi-copy/mean field approach generally present a continuous, yet composite interface, with one part belonging to the rigid portion of the flexible protein and the complement to the flexible part. The problem may therefore be put in terms of the generation of a complementary fraction of the rigid interface part, from the refolding/positioning of the flexible part. Interestingly, correct position/orientation of the ligand could be obtained for highly ranked predicted structures even for limited spatial density of the conformer ensemble, which also limits the probability to include a conformer close to the experimental structure in the copy ensemble. In one interesting case , the interface between a flexible loop and the association partner could be almost entirely reconstituted from a misfolded conformer, which positioned key loop residues at favorable positions (Figure 5). More often, it was found that in the tested cases, only few residues from the flexible parts needed to interact with the docking partner for the resulting complex to increase its interaction energy above the background noise (results not shown). While the generalization of this observation remains to be established, the notion of composite interface rebuilding appears to constitute an important component of the success of two flexible docking search methods presented below, which deal with large amplitude interface flexibility.
3.2.4. Multi-Component Docking
When the protein deformation is composed of hinge motions between two or more domains, it is possible to artificially split the flexible domains and to separately assemble them with the partner of association within multibody docking algorithms [61,62]. While the approach developed by the Eisenstein group was a multibody, multistage approach (docking D1 to L, D2 to L then D1 to D2-L and D2 to D1-L, where D1, D2 are two domains of the receptor moving independently as rigid bodies, and L is the ligand), the groups of Nussinov and Wolfson have developed a high performance algorithm, built on geometric hashing techniques, to generate topologically feasible and energetically favorable complexes with composite interface, starting from the results of an initial set of two-body docking simulations [61,63,64]. The algorithm was initially developed to performing multi-macromolecular docking (CombDock [63,65], which requires the resolution of a highly complex combinatorial search problem. The only difference with flexible hinge domain docking is that specific restraints were added to the process to ensure that the split protein can be reconstructed at the end of the process. A consequence is that it can be applied to proteins where the arrangement of several domains is modified upon association. The high velocity of the docking search method, based on the comparison of surface descriptors for each partner of association , makes it possible to routinely run flexible docking simulations involving hinge-type domain motions . The adaptation of multi-macromolecular docking to hinge domain flexible docking via the introduction of restraints appears particularly well adapted to data-driven type docking methods like HADDOCK . Since multi-macromolecular docking facility was recently introduced into the HADDOCK web server , it is now possible to perform hinge domain flexible docking on the HADDOCK Web server (http://hadock.chem.uu.nl).
An interesting observation from multi-component docking simulations is that the partial two-body interfaces that are selected as component of the final system interface often rank poorly in the initial two-body docking simulations [63,68]. Similarly to what was observed for the flexible loops, these partial interfaces need to be reinforced by complementary interactions in order for the correct assembly to be distinguished from alternative solutions.
188.8.131.52. Interactive Loop Reconstruction
Recently, an astute solution was included in the RosettaDock multi-scale Monte Carlo docking program to account for high amplitude loop remodeling during docking processes . In this approach, the flexible loop is artificially removed from the protein and is rebuilt during the docking process with RosettaDock, first at low resolution during the early docking stages and then at higher resolution during refinement search. The reconstruction involves robotic algorithms for loop closure together with Monte Carlo and Monte Carlo minimization moves for structure sampling. Recently, Mandell and Kortemme proposed an analytical loop reconstruction algorithm, also based on robotic techniques, for precise loop reconstruction at atomic resolution . Optimally fitting long loops to a DNA surface during docking could also be achieved using interactive molecular dynamics simulation . Again, the efficiency of loop reconstruction methods is strongly dependent on the existence of a composite interface, partly formed from the rigid protein core and partly from the flexible loop.
Taking protein flexibility into account in docking protocols is a highly challenging methodological problem, where combined levels of search and refinement need to be integrated, from low resolution and high amplitude movements to atomic relaxation of side chains and backbones. Innovative solutions have been proposed during recent years at each of these levels, which announce in the near future the release of fully flexible docking programs capable of handling every type of flexibility, for example solving all the “difficult” docking cases of the protein-protein benchmark. Such programs may consist of a modular workflow with automatic or user-input decision steps concerning the level of flexibility (local or global), the method to be employed, the pre-generation of conformer ensembles. An example of such workflow is presented in Figure 6. Further understanding of the mechanism of protein deformations, as well as ongoing investigations on the characteristics of protein-protein interfaces, will be useful to improve the efficiency of flexible docking algorithms.
- Wodak, SJ; Janin, J. Computer analysis of protein-protein interaction. J. Mol. Biol 1978, 124, 323–342.
- Janin, J; Henrick, K; Moult, J; Eyck, LT; Sternberg, MJE; Vajda, S; Vakser, I; Wodak, SJ.. of PRedicted Interactions, C.A. CAPRI: A Critical Assessment of PRedicted Interactions. Proteins 2003, 52, 2–9.
- Mendez, R; Leplae, R; Maria, LD; Wodak, SJ. Assessment of blind predictions of protein-protein interactions: current status of docking methods. Proteins 2003, 52, 51–67.
- Janin, J. Assessing predictions of protein-protein interaction: the CAPRI experiment. Protein Sci 2005, 14, 278–283.
- Mendez, R; Leplae, R; Lensink, MF; Wodak, SJ. Assessment of CAPRI predictions in rounds 3–5 shows progress in docking procedures. Proteins 2005, 60, 150–169.
- Lensink, MF; Mndez, R; Wodak, SJ. Docking and scoring protein complexes: CAPRI 3rd Edition. Proteins 2007, 69, 704–718.
- Lensink, MF; Wodak, SJ. Docking and scoring protein interactions: CAPRI 2009. Proteins 2010, 78, 3073–3084.
- Bonvin, AMJJ. Flexible protein-protein docking. Curr. Opin. Struct. Biol 2006, 16, 194–200.
- Andrusier, N; Mashiach, E; Nussinov, R; Wolfson, HJ. Principles of flexible protein-protein docking. Proteins 2008, 73, 271–289.
- Ritchie, DW. Recent progress and future directions in protein-protein docking. Curr. Protein Pept. Sci 2008, 9, 1–15.
- Zacharias, M. Accounting for conformational changes during protein-protein docking. Curr. Opin. Struct. Biol 2010, 20, 180–186.
- Saladin, A; Prévost, C. Protein-Protein Docking. In Protein-Protein Complexes Analysis, Modeling and Drug Design; Zacharias, M, Ed.; Imperial College Press: London, UK, 2010; pp. 147–181.
- Zacharias, M. Scoring and Refinement of Predicted Protein-Protein Complexes. In Protein-Protein Complexes Analysis, Modeling and Drug Design; Zacharias, M, Ed.; Imperial College Press: London, UK, 2010; pp. 236–271.
- Pons, C; Grosdidier, S; Solernou, A; Pérez-Cano, L; Fernàndez-Recio, J. Present and future challenges and limitations in protein-protein docking. Proteins 2010, 78, 95–108.
- Bastard, K; Prévost, C. Recent Research Advances in Structural BioInformatics. In Flexible Macromolecular Docking: An Overview of Recent Progress; de Brevern, AG, Ed.; Research Signpost: Trivandrum, India, 2007; pp. 249–274.
- Vajda, S; Kozakov, D. Convergence and combination of methods in protein-protein docking. Curr. Opin. Struct. Biol 2009, 19, 164–170.
- Norel, R; Lin, SL; Wolfson, HJ; Nussinov, R. Shape complementarity at protein-protein interfaces. Biopolymers 1994, 34, 933–940.
- Ritchie, DW; Kemp, GJ. Protein docking using spherical polar Fourier correlations. Proteins 2000, 39, 178–194.
- Katchalski-Katzir, E; Shariv, I; Eisenstein, M; Friesem, AA; Aflalo, C; Vakser, IA. Molecular surface recognition: determination of geometric fit between proteins and their ligands by correlation techniques. Proc. Natl. Acad. Sci. USA 1992, 89, 2195–2199.
- Zacharias, M. Protein-protein docking with a reduced protein model accounting for side-chain flexibility. Protein Sci 2003, 12, 1271–1282.
- Schueler-Furman, O; Wang, C; Baker, D. Progress in protein-protein docking: atomic resolution predictions in the CAPRI experiment using RosettaDock with an improved treatment of side-chain flexibility. Proteins 2005, 60, 187–194.
- Fernández-Recio, J; Totrov, M; Abagyan, R. ICM-DISCO docking by global energy optimization with fully flexible side-chains. Proteins 2003, 52, 113–117.
- Król, M; Tournier, AL; Bates, PA. Flexible relaxation of rigid-body docking solutions. Proteins 2007, 68, 159–169.
- Wang, C; Bradley, P; Baker, D. Protein-protein docking with backbone flexibility. J. Mol. Biol 2007, 373, 503–519.
- Andrusier, N; Nussinov, R; Wolfson, HJ. FireDock: Fast interaction refinement in molecular docking. Proteins 2007, 69, 139–159.
- Kozakov, D; Hall, DR; Beglov, D; Brenke, R; Comeau, SR; Shen, Y; Li, K; Zheng, J; Vakili, P; Paschalidis, IC; Vajda, S. Achieving reliability and high accuracy in automated protein docking: ClusPro, PIPER, SDU, and stability analysis in CAPRI rounds 13–19. Proteins 2010, 78, 3124–3130.
- Noy, E; Goldblum, A. Flexible protein-protein docking based on Best-First search algorithm. J. Comput. Chem 2010, 31, 1929–1943.
- Hwang, H; Vreven, T; Janin, J; Weng, Z. Protein-protein docking benchmark version 4.0. Proteins 2010, 78, 3111–3114.
- Jackson, RM; Gabb, HA; Sternberg, MJ. Rapid refinement of protein interfaces incorporating solvation: application to the docking problem. J. Mol. Biol 1998, 276, 265–285.
- Kimura, SR; Brower, RC; Vajda, S; Camacho, CJ. Dynamical view of the positions of key side chains in protein-protein recognition. Biophys. J 2001, 80, 635–642.
- Rajamani, D; Thiel, S; Vajda, S; Camacho, CJ. Anchor residues in protein-protein interactions. Proc. Natl. Acad. Sci. USA 2004, 101, 11287–11292.
- Bastard, K; Thureau, A; Lavery, R; Prévost, C. Docking macromolecules with flexible segments. J. Comput. Chem 2003, 24, 1910–1920.
- Dominguez, C; Boelens, R; Bonvin, AMJJ. HADDOCK: A protein-protein docking approach based on biochemical or biophysical information. J. Am. Chem. Soc 2003, 125, 1731–1737.
- de Vries, SJ; van Dijk, ADJ; Krzeminski, M; van Dijk, M; Thureau, A; Hsu, V; Wassenaar, T; Bonvin, AMJJ. HADDOCK versus HADDOCK: New features and performance of HADDOCK2.0 on the CAPRI targets. Proteins 2007, 69, 726–733.
- May, A; Zacharias, M. Protein-ligand docking accounting for receptor side chain and global flexibility in normal modes: Evaluation on kinase inhibitor cross docking. J. Med. Chem 2008, 51, 3499–3506.
- Mashiach, E; Nussinov, R; Wolfson, HJ. FiberDock: Flexible induced-fit backbone refinement in molecular docking. Proteins 2010, 78, 1503–1519.
- Ehrlich, LP; Nilges, M; Wade, RC. The impact of protein flexibility on protein-protein docking. Proteins 2005, 58, 126–133.
- Suhre, K; Sanejouand, YH. ElNemo: A normal mode web server for protein movement analysis and the generation of templates for molecular replacement. Nucleic Acids Res 2004, 32, W610–W614.
- Dobbins, SE; Lesk, VI; Sternberg, MJE. Insights into protein flexibility: The relationship between normal modes and conformational change upon protein-protein docking. Proc. Natl. Acad. Sci. USA 2008, 105, 10390–10395.
- Navizet, I; Cailliez, F; Lavery, R. Probing protein mechanics: residue-level properties and their use in defining domains. Biophys. J 2004, 87, 1426–1435.
- Sacquin-Mora, S; Lavery, R. Modeling the mechanical response of proteins to anisotropic deformation. Chemphyschem 2009, 10, 115–118.
- Sacquin-Mora, S; Laforet, E; Lavery, R. Locating the active sites of enzymes using mechanical properties. Proteins 2007, 67, 350–359.
- Lavery, R; Sacquin-Mora, S. Protein mechanics: A route from structure to function. J. Biosci 2007, 32, 891–898.
- Emekli, U; Schneidman-Duhovny, D; Wolfson, HJ; Nussinov, R; Haliloglu, T. HingeProt: Automated prediction of hinges in protein structures. Proteins 2008, 70, 1219–1227.
- Jacobs, DJ; Rader, AJ; Kuhn, LA; Thorpe, MF. Protein flexibility predictions using graph theory. Proteins 2001, 44, 150–165.
- Keating, KS; Flores, SC; Gerstein, MB; Kuhn, LA. StoneHinge: Hinge prediction by network analysis of individual protein structures. Protein Sci 2009, 18, 359–371.
- Koshland, DE. Application of a Theory of Enzyme Specificity to Protein Synthesis. Proc. Natl. Acad. Sci. USA 1958, 44, 98–104.
- Kumar, S; Ma, B; Tsai, CJ; Sinha, N; Nussinov, R. Folding and binding cascades: Dynamic landscapes and population shifts. Protein Sci 2000, 9, 10–19.
- May, A; Zacharias, M. Accounting for global protein deformability during protein-protein and protein-ligand docking. Biochim. Biophys. Acta 2005, 1754, 225–231.
- Grunberg, R; Leckner, J; Nilges, M. Complementarity of structure ensembles in protein-protein binding. Structure 2004, 12, 2125–2136.
- Mustard, D; Ritchie, DW. Docking essential dynamics eigenstructures. Proteins 2005, 60, 269–274.
- Smith, GR; Sternberg, MJE; Bates, PA. The relationship between the flexibility of proteins and their conformational states on forming protein-protein complexes with an application to protein-protein docking. J. Mol. Biol 2005, 347, 1077–1101.
- Chaudhury, S; Gray, JJ. Conformer selection and induced fit in flexible backbone protein-protein docking using computational and NMR ensembles. J. Mol. Biol 2008, 381, 1068–1087.
- Ritchie, DW; Venkatraman, V. Ultra-fast FFT protein docking on graphics processors. Bioinformatics 2010, 26, 2398–2405.
- Cortés, J; Siméon, T; de Angulo, VR; Guieysse, D; Remaud-Siméon, M; Tran, V. A path planning approach for computing large-amplitude motions of flexible molecules. Bioinformatics 2005, i116–i125.
- Regad, L; Martin, J; Nuel, G; Camproux, AC. Mining protein loops using a structural alphabet and statistical exceptionality. BMC Bioinforma 2010, 11, 75.
- Shehu, A; Clementi, C; Kavraki, LE. Modeling protein conformational ensembles: from missing loops to equilibrium fluctuations. Proteins 2006, 65, 164–179.
- Mandell, DJ; Kortemme, T. Backbone flexibility in computational protein design. Curr. Opin. Biotechnol 2009, 20, 420–428.
- Bastard, K; Prévost, C; Zacharias, M. Accounting for loop flexibility during protein-protein docking. Proteins 2006, 62, 956–969.
- Loriot, S; Sachdeva, S; Bastard, K; Prévost, C; Cazals, F. On the Characterization and Selection of Diverse Conformational Ensembles, with Applications to Flexible Docking. IEEE/ACM Trans.Comput. Biol. Bioinf 2011, 8, 487–498.
- Schneidman-Duhovny, D; Inbar, Y; Nussinov, R; Wolfson, HJ. Geometry-based flexible and symmetric protein docking. Proteins 2005, 60, 224–231.
- Ben-Zeev, E; Kowalsman, N; Ben-Shimon, A; Segal, D; Atarot, T; Noivirt, O; Shay, T; Eisenstein, M. Docking to single-domain and multiple-domain proteins: Old and new challenges. Proteins 2005, 60, 195–201.
- Inbar, Y; Benyamini, H; Nussinov, R; Wolfson, HJ. Prediction of multimolecular assemblies by multiple docking. J. Mol. Biol 2005, 349, 435–447.
- Schneidman-Duhovny, D; Nussinov, R; Wolfson, HJ. Automatic prediction of protein interactions with large scale motion. Proteins 2007, 69, 764–773.
- Inbar, Y; Benyamini, H; Nussinov, R; Wolfson, HJ. Combinatorial docking approach for structure prediction of large proteins and multi-molecular assemblies. Phys. Biol 2005, 2, S156–S165.
- van Dijk, ADJ; de Vries, SJ; Dominguez, C; Chen, H; Zhou, HX; Bonvin, AMJJ. Data-driven docking: HADDOCK’s adventures in CAPRI. Proteins 2005, 60, 232–238.
- Karaca, E; Melquiond, ASJ; de Vries, SJ; Kastritis, PL; Bonvin, AMJJ. Building macromolecular assemblies by information-driven docking: Introducing the HADDOCK multibody docking server. Mol. Cell Proteomics 2010, 9, 1784–1794.
- Saladin, A; Fiorucci, S; Poulain, P; Prévost, C; Zacharias, M. PTools: An opensource molecular docking library. BMC Struct. Biol 2009, 9, 27.
- Mandell, DJ; Coutsias, EA; Kortemme, T. Sub-angstrom accuracy in protein loop reconstruction by robotics-inspired conformational sampling. Nat. Methods 2009, 6, 551–552.
- Saladin, A; Amourda, C; Poulain, P; Férey, N; Baaden, M; Zacharias, M; Delalande, O; Prévost, C. Modeling the early stage of DNA sequence recognition within RecA nucleoprotein filaments. Nucleic Acids Res 2010, 38, 6313–6323.
© 2011 by the authors; licensee MDPI, Basel, Switzerland. This article is an open-access article distributed under the terms and conditions of the Creative Commons Attribution license (http://creativecommons.org/licenses/by/3.0/).