DockTrina: docking triangular protein trimers

RL-MLZerD: Multimeric protein docking using reinforcement learning

Numerous biological processes in a cell are carried out by protein complexes. To understand the molecular mechanisms of such processes, it is crucial to know the quaternary structures of the complexes. Although the structures of protein complexes have been determined by biophysical experiments at a rapid pace, there are still many important complex structures that are yet to be determined. To supplement experimental structure determination of complexes, many computational protein docking methods have been developed; however, most of these docking methods are designed only for docking with two chains. Here, we introduce a novel method, RL-MLZerD, which builds multiple protein complexes using reinforcement learning (RL). In RL-MLZerD a multi-chain assembly process is considered as a series of episodes of selecting and integrating pre-computed pairwise docking models in a RL framework. RL is effective in correctly selecting plausible pairwise models that fit well with other subunits in a complex. When tested on a benchmark dataset of protein complexes with three to five chains, RL-MLZerD showed better modeling performance than other existing multiple docking methods under different evaluation criteria, except against AlphaFold-Multimer in unbound docking. Also, it emerged that the docking order of multi-chain complexes can be naturally predicted by examining preferred paths of episodes in the RL computation.

Controlled-advancement rigid-body optimization of nanosystems

In this study, we propose a novel optimization algorithm, with application to the refinement of molecular complexes. Particularly, we consider optimization problem as the calculation of quasi-static trajectories of rigid bodies influenced by the inverse-inertia-weighted energy gradient and introduce the concept of advancement region that guarantees displacement of a molecule strictly within a relevant region of conformational space. The advancement region helps to avoid typical energy minimization pitfalls, thus, the algorithm is suitable to work with arbitrary energy functions and arbitrary types of molecular complexes without necessary tuning of its hyper-parameters. Our method, called controlled-advancement rigid-body optimization of nanosystems (Carbon), is particularly useful for the large-scale molecular refinement, as for example, the putative binding candidates obtained with protein-protein docking pipelines. Implementation of Carbon with user-friendly interface is available in the SAMSON platform for molecular modeling at https://www.samson-connect.net. © 2019 Wiley Periodicals, Inc.

RapidRMSD: rapid determination of RMSDs corresponding to motions of flexible molecules

Motivation

The root mean square deviation (RMSD) is one of the most used similarity criteria in structural biology and bioinformatics. Standard computation of the RMSD has a linear complexity with respect to the number of atoms in a molecule, making RMSD calculations time-consuming for the large-scale modeling applications, such as assessment of molecular docking predictions or clustering of spatially proximate molecular conformations. Previously, we introduced the RigidRMSD algorithm to compute the RMSD corresponding to the rigid-body motion of a molecule. In this study, we go beyond the limits of the rigid-body approximation by taking into account conformational flexibility of the molecule. We model the flexibility with a reduced set of collective motions computed with e.g. normal modes or principal component analysis.

Results

The initialization of our algorithm is linear in the number of atoms and all the subsequent evaluations of RMSD values between flexible molecular conformations depend only on the number of collective motions that are selected to model the flexibility. Therefore, our algorithm is much faster compared to the standard RMSD computation for large-scale modeling applications. We demonstrate the efficiency of our method on several clustering examples, including clustering of flexible docking results and molecular dynamics (MD) trajectories. We also demonstrate how to use the presented formalism to generate pseudo-random constant-RMSD structural molecular ensembles and how to use these in cross-docking.

Availability and implementation

We provide the algorithm written in C++ as the open-source RapidRMSD library governed by the BSD-compatible license, which is available at http://team.inria.fr/nano-d/software/RapidRMSD/. The constant-RMSD structural ensemble application and clustering of MD trajectories is available at http://team.inria.fr/nano-d/software/nolb-normal-modes/.

Supplementary information

Supplementary data are available at Bioinformatics online.

Modeling the assembly order of multimeric heteroprotein complexes

Protein-protein interactions are the cornerstone of numerous biological processes. Although an increasing number of protein complex structures have been determined using experimental methods, relatively fewer studies have been performed to determine the assembly order of complexes. In addition to the insights into the molecular mechanisms of biological function provided by the structure of a complex, knowing the assembly order is important for understanding the process of complex formation. Assembly order is also practically useful for constructing subcomplexes as a step toward solving the entire complex experimentally, designing artificial protein complexes, and developing drugs that interrupt a critical step in the complex assembly. There are several experimental methods for determining the assembly order of complexes; however, these techniques are resource-intensive. Here, we present a computational method that predicts the assembly order of protein complexes by building the complex structure. The method, named Path-LzerD, uses a multimeric protein docking algorithm that assembles a protein complex structure from individual subunit structures and predicts assembly order by observing the simulated assembly process of the complex. Benchmarked on a dataset of complexes with experimental evidence of assembly order, Path-LZerD was successful in predicting the assembly pathway for the majority of the cases. Moreover, when compared with a simple approach that infers the assembly path from the buried surface area of subunits in the native complex, Path-LZerD has the strong advantage that it can be used for cases where the complex structure is not known. The path prediction accuracy decreased when starting from unbound monomers, particularly for larger complexes of five or more subunits, for which only a part of the assembly path was correctly identified. As the first method of its kind, Path-LZerD opens a new area of computational protein structure modeling and will be an indispensable approach for studying protein complexes.

Protein-Protein Docking

Protein-protein docking algorithms are powerful computational tools, capable of analyzing the protein-protein interactions at the atomic-level. In this chapter, we will review the theoretical concepts behind different protein-protein docking algorithms, highlighting their strengths as well as their limitations and pointing to important case studies for each method. The methods we intend to cover in this chapter include various search strategies and scoring techniques. This includes exhaustive global search, fast Fourier transform search, spherical Fourier transform-based search, direct search in Cartesian space, local shape feature matching, geometric hashing, genetic algorithm, randomized search, and Monte Carlo search. We will also discuss the different ways that have been used to incorporate protein flexibility within the docking procedure and some other future directions in this field, suggesting possible ways to improve the different methods.

NMR analysis of the interaction of picornaviral proteinases Lb and 2A with their substrate eukaryotic initiation factor 4GII

Messenger RNA is recruited to the eukaryotic ribosome by a complex including the eukaryotic initiation factor (eIF) 4E (the cap-binding protein), the scaffold protein eIF4G and the RNA helicase eIF4A. To shut-off host-cell protein synthesis, eIF4G is cleaved during picornaviral infection by a virally encoded proteinase; the structural basis of this reaction and its stimulation by eIF4E is unclear. We have structurally and biochemically investigated the interaction of purified foot-and-mouth disease virus (FMDV) leader proteinase (Lb(pro)), human rhinovirus 2 (HRV2) 2A proteinase (2A(pro)) and coxsackievirus B4 (CVB4) 2A(pro) with purified eIF4GII, eIF4E and the eIF4GII/eIF4E complex. Using nuclear magnetic resonance (NMR), we completed (13)C/(15) N sequential backbone assignment of human eIF4GII residues 551-745 and examined their binding to murine eIF4E. eIF4GII551-745 is intrinsically unstructured and remains so when bound to eIF4E. NMR and biophysical techniques for determining stoichiometry and binding constants revealed that the papain-like Lb(pro) only forms a stable complex with eIF4GII(551-745) in the presence of eIF4E, with KD values in the low nanomolar range; Lb(pro) contacts both eIF4GII and eIF4E. Furthermore, the unrelated chymotrypsin-like 2A(pro) from HRV2 and CVB4 also build a stable complex with eIF4GII/eIF4E, but with K(D) values in the low micromolar range. The HRV2 enzyme also forms a stable complex with eIF4E; however, none of the proteinases tested complex stably with eIF4GII alone. Thus, these three picornaviral proteinases have independently evolved to establish distinct triangular heterotrimeric protein complexes that may actively target ribosomes involved in mRNA recruitment to ensure efficient host cell shut-off.

Large oligomeric complex structures can be computationally assembled by efficiently combining docked interfaces

Macromolecular oligomeric assemblies are involved in many biochemical processes of living organisms. The benefits of such assemblies in crowded cellular environments include increased reaction rates, efficient feedback regulation, cooperativity and protective functions. However, an atom-level structural determination of large assemblies is challenging due to the size of the complex and the difference in binding affinities of the involved proteins. In this study, we propose a novel combinatorial greedy algorithm for assembling large oligomeric complexes from information on the approximate position of interaction interfaces of pairs of monomers in the complex. Prior information on complex symmetry is not required but rather the symmetry is inferred during assembly. We implement an efficient geometric score, the transformation match score, that bypasses the model ranking problems of state-of-the-art scoring functions by scoring the similarity between the inferred dimers of the same monomer simultaneously with different binding partners in a (sub)complex with a set of pregenerated docking poses. We compiled a diverse benchmark set of 308 homo and heteromeric complexes containing 6 to 60 monomers. To explore the applicability of the method, we considered 48 sets of parameters and selected those three sets of parameters, for which the algorithm can correctly reconstruct the maximum number, namely 252 complexes (81.8%) in, at least one of the respective three runs. The crossvalidation coverage, that is, the mean fraction of correctly reconstructed benchmark complexes during crossvalidation, was 78.1%, which demonstrates the ability of the presented method to correctly reconstruct topology of a large variety of biological complexes.

The near-symmetry of proteins

The majority of protein oligomers form clusters which are nearly symmetric. Understanding of that imperfection, its origins, and perhaps also its advantages requires the conversion of the currently used vague qualitative descriptive language of the near-symmetry into an accurate quantitative measure that will allow to answer questions such as: "What is the degree of symmetry deviation of the protein?," "how do these deviations compare within a family of proteins?," and so on. We developed quantitative methods to answer this type of questions, which are capable of analyzing the whole protein, its backbone or selected portions of it, down to comparison of symmetry-related specific amino-acids, and which are capable of visualizing the various levels of symmetry deviations in the form of symmetry maps. We have applied these methods on an extensive list of homomers and heteromers and found that apparently all proteins never reach perfect symmetry. Strikingly, even homomeric protein clusters are never ideally symmetric. We also found that the main burden of symmetry distortion is on the amino-acids near the symmetry axis; that it is mainly the more hydrophilic amino-acids that take place in symmetry-distortive interactions; and more. The remarkable ability of heteromers to preserve near-symmetry, despite the different sequences, was also shown and analyzed. The comprehensive literature on the suggested advantages symmetric oligomerizations raises a yet-unsolved key question: If symmetry is so advantageous, why do proteins stop shy of perfect symmetry? Some tentative answers to be tested in further studies are suggested in a concluding outlook.

Drug-Like Protein-Protein Interaction Modulators: Challenges and Opportunities for Drug Discovery and Chemical Biology

[Formula: see text] Fundamental processes in living cells are largely controlled by macromolecular interactions and among them, protein-protein interactions (PPIs) have a critical role while their dysregulations can contribute to the pathogenesis of numerous diseases. Although PPIs were considered as attractive pharmaceutical targets already some years ago, they have been thus far largely unexploited for therapeutic interventions with low molecular weight compounds. Several limiting factors, from technological hurdles to conceptual barriers, are known, which, taken together, explain why research in this area has been relatively slow. However, this last decade, the scientific community has challenged the dogma and became more enthusiastic about the modulation of PPIs with small drug-like molecules. In fact, several success stories were reported both, at the preclinical and clinical stages. In this review article, written for the 2014 International Summer School in Chemoinformatics (Strasbourg, France), we discuss in silico tools (essentially post 2012) and databases that can assist the design of low molecular weight PPI modulators (these tools can be found at www.vls3d.com). We first introduce the field of protein-protein interaction research, discuss key challenges and comment recently reported in silico packages, protocols and databases dedicated to PPIs. Then, we illustrate how in silico methods can be used and combined with experimental work to identify PPI modulators.

Rapid determination of RMSDs corresponding to macromolecular rigid body motions

Finding the root mean sum of squared deviations (RMSDs) between two coordinate vectors that correspond to the rigid body motion of a macromolecule is an important problem in structural bioinformatics, computational chemistry, and molecular modeling. Standard algorithms compute the RMSD with time proportional to the number of atoms in the molecule. Here, we present RigidRMSD, a new algorithm that determines a set of RMSDs corresponding to a set of rigid body motions of a macromolecule in constant time with respect to the number of atoms in the molecule. Our algorithm is particularly useful for rigid body modeling applications, such as rigid body docking, and also for high-throughput analysis of rigid body modeling and simulation results. We also introduce a constant-time rotation RMSD as a similarity measure for rigid molecules. A C++ implementation of our algorithm is available at http://nano-d.inrialpes.fr/software/RigidRMSD.