Advances to tackle backbone flexibility in protein docking

Advancing membrane-associated protein docking with improved sampling and scoring in Rosetta

The oligomerization of protein macromolecules on cell membranes plays a fundamental role in regulating cellular function. From modulating signal transduction to directing immune response, membrane proteins (MPs) play a crucial role in biological processes and are often the target of many pharmaceutical drugs. Despite their biological relevance, the challenges in experimental determination have hampered the structural availability of membrane proteins and their complexes. Computational docking provides a promising alternative to model membrane protein complex structures. Here, we present Rosetta-MPDock, a flexible transmembrane (TM) protein docking protocol that captures binding-induced conformational changes. Rosetta-MPDock samples large conformational ensembles of flexible monomers and docks them within an implicit membrane environment. We benchmarked this method on 29 TM-protein complexes of variable backbone flexibility. These complexes are classified based on the root-mean-square deviation between the unbound and bound states (RMSDUB) as: rigid (RMSDUB <1.2 Å), moderately-flexible (RMSDUB ∈ [1.2, 2.2) Å), and flexible targets (RMSDUB > 2.2 Å). In a local docking scenario, i.e. with membrane protein partners starting ≈10 Å apart embedded in the membrane in their unbound conformations, Rosetta-MPDock successfully predicts the correct interface (success defined as achieving 3 near-native structures in the 5 top-ranked models) for 67% moderately flexible targets and 60% of the highly flexible targets, a substantial improvement from the existing membrane protein docking methods. Further, by integrating AlphaFold2-multimer for structure determination and using Rosetta-MPDock for docking and refinement, we demonstrate improved success rates over the benchmark targets from 64% to 73%. Rosetta-MPDock advances the capabilities for membrane protein complex structure prediction and modeling to tackle key biological questions and elucidate functional mechanisms in the membrane environment. The benchmark set and the code is available for public use at github.com/Graylab/MPDock.

Predicting binding events in very flexible, allosteric, multi-domain proteins

Knowledge of the structures formed by proteins and small ligands is of fundamental importance for understanding molecular principles of chemotherapy and for designing new and more effective drugs. Due to the still high costs and to the several limitations of experimental techniques, it is most often desirable to predict these ligand-protein complexes in silico, particularly when screening for new putative drugs from databases of millions of compounds. While virtual screening based on molecular docking is widely used for this purpose, it generally fails in mimicking binding events associated with large conformational changes in the protein, particularly when the latter involve multiple domains. In this work, we describe a new methodology aimed at generating bound-like conformations of very flexible and allosteric proteins bearing multiple binding sites. Validation was performed on the enzyme adenylate kinase (ADK), a paradigmatic example of proteins that undergo very large conformational changes upon ligand binding. By only exploiting the unbound structure and the putative binding sites of the protein, we generated a significant fraction of bound-like structures, which employed in ensemble-docking calculations allowed to find native-like poses of substrates, inhibitors, and catalytically incompetent binders. Our protocol provides a general framework for the generation of bound-like conformations of flexible proteins that are suitable to host different ligands, demonstrating high sensitivity to the fine chemical details that regulate protein's activity. We foresee applications in virtual screening for difficult targets, prediction of the impact of amino acid mutations on structure and dynamics, and protein engineering.

Deep learning in modeling protein complex structures: From contact prediction to end-to-end approaches

Protein-protein interactions play crucial roles in many biological processes. Traditionally, protein complex structures are normally built by protein-protein docking. With the rapid development of artificial intelligence and its great success in monomer protein structure prediction, deep learning has widely been applied to modeling protein-protein complex structures through inter-protein contact prediction and end-to-end approaches in the past few years. This article reviews the recent advances of deep-learning-based approaches in modeling protein-protein complex structures as well as their advantages and limitations. Challenges and possible future directions are also briefly discussed in applying deep learning for the prediction of protein complex structures.

Docking Foundations: From Rigid to Flexible Docking

Despite the development of methods for the experimental determination of protein structures, the dissonance between the number of known sequences and their solved structures is still enormous. This is particularly evident in protein-protein complexes. To fill this gap, diverse technologies have been developed to study protein-protein interactions (PPIs) in a cellular context including a range of biological and computational methods. The latter derive from techniques originally published and applied almost half a century ago and are based on interdisciplinary knowledge from the nexus of the fields of biology, chemistry, and physics about protein sequences, structures, and their folding. Protein-protein docking, the main protagonist of this chapter, is routinely treated as an integral part of protein research. Herein, we describe the basic foundations of the whole process in general terms, but step by step from protein representations through docking methods and evaluation of complexes to their final validation.

Approaches to Backbone Flexibility in Protein-Protein Docking

Proteins are the fundamental organic macromolecules in living systems that play a key role in a variety of biological functions including immunological detection, intracellular trafficking, and signal transduction. The docking of proteins has greatly advanced during recent decades and has become a crucial complement to experimental methods. Protein-protein docking is a helpful method for simulating protein complexes whose structures have not yet been solved experimentally. This chapter focuses on major search tactics along with various docking programs used in protein-protein docking algorithms, which include: direct search, exhaustive global search, local shape feature matching, randomized search, and broad category of post-docking approaches. As backbone flexibility predictions and interactions in high-resolution protein-protein docking remain important issues in the overall optimization context, we have put forward several methods and solutions used to handle backbone flexibility. In addition, various docking methods that are utilized for flexible backbone docking, including ATTRACT, FlexDock, FLIPDock, HADDOCK, RosettaDock, FiberDock, etc., along with their scoring functions, algorithms, advantages, and limitations are discussed. Moreover, what progress in search technology is expected, including not only the creation of new search algorithms but also the enhancement of existing ones, has been debated. As conformational flexibility is one of the most crucial factors affecting docking success, more work should be put into evaluating the conformational flexibility upon binding for a particular case in addition to developing new algorithms to replace the rigid body docking and scoring approach.

Molecular Dynamics and Other HPC Simulations for Drug Discovery

High performance computing (HPC) is taking an increasingly important place in drug discovery. It makes possible the simulation of complex biochemical systems with high precision in a short time, thanks to the use of sophisticated algorithms. It promotes the advancement of knowledge in fields that are inaccessible or difficult to access through experimentation and it contributes to accelerating the discovery of drugs for unmet medical needs while reducing costs. Herein, we report how computational performance has evolved over the past years, and then we detail three domains where HPC is essential. Molecular dynamics (MD) is commonly used to explore the flexibility of proteins, thus generating a better understanding of different possible approaches to modulate their activity. Modeling and simulation of biopolymer complexes enables the study of protein-protein interactions (PPI) in healthy and disease states, thus helping the identification of targets of pharmacological interest. Virtual screening (VS) also benefits from HPC to predict in a short time, among millions or billions of virtual chemical compounds, the best potential ligands that will be tested in relevant assays to start a rational drug design process.

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.

Critical Assessment of Methods for Predicting the 3D Structure of Proteins and Protein Complexes

Advances in a scientific discipline are often measured by small, incremental steps. In this review, we report on two intertwined disciplines in the protein structure prediction field, modeling of single chains and modeling of complexes, that have over decades emulated this pattern, as monitored by the community-wide blind prediction experiments CASP and CAPRI. However, over the past few years, dramatic advances were observed for the accurate prediction of single protein chains, driven by a surge of deep learning methodologies entering the prediction field. We review the mainscientific developments that enabled these recent breakthroughs and feature the important role of blind prediction experiments in building up and nurturing the structure prediction field. We discuss how the new wave of artificial intelligence-based methods is impacting the fields of computational and experimental structural biology and highlight areas in which deep learning methods are likely to lead to future developments, provided that major challenges are overcome.

Improving classification of correct and incorrect protein-protein docking models by augmenting the training set

Motivation

Protein-protein interactions drive many relevant biological events, such as infection, replication and recognition. To control or engineer such events, we need to access the molecular details of the interaction provided by experimental 3D structures. However, such experiments take time and are expensive; moreover, the current technology cannot keep up with the high discovery rate of new interactions. Computational modeling, like protein-protein docking, can help to fill this gap by generating docking poses. Protein-protein docking generally consists of two parts, sampling and scoring. The sampling is an exhaustive search of the tridimensional space. The caveat of the sampling is that it generates a large number of incorrect poses, producing a highly unbalanced dataset. This limits the utility of the data to train machine learning classifiers.

Results

Using weak supervision, we developed a data augmentation method that we named hAIkal. Using hAIkal, we increased the labeled training data to train several algorithms. We trained and obtained different classifiers; the best classifier has 81% accuracy and 0.51 Matthews' correlation coefficient on the test set, surpassing the state-of-the-art scoring functions.

Availability and implementation

Docking models from Benchmark 5 are available at https://doi.org/10.5281/zenodo.4012018. Processed tabular data are available at https://repository.kaust.edu.sa/handle/10754/666961. Google colab is available at https://colab.research.google.com/drive/1vbVrJcQSf6\_C3jOAmZzgQbTpuJ5zC1RP?usp=sharing.

Supplementary information

Supplementary data are available at Bioinformatics Advances online.

How to Design Peptides

Novel design of proteins to target receptors for treatment or tissue augmentation has come to the fore owing to advancements in computing power, modeling frameworks, and translational successes. Shorter proteins, or peptides, can offer combinatorial synergies with dendrimer, polymer, or other peptide carriers for enhanced local signaling, which larger proteins may sterically hinder. Here, we present a generalized method for designing a novel peptide. We first show how to create a script protocol that can be used to iteratively optimize and screen novel peptide sequences for binding a target protein. We present a step-by-step introduction to utilizing file repositories, data bases, and the Rosetta software suite. RosettaScripts, an .xml interface that allows for sequential functions to be performed, is used to order the functions for repeatable performance. These strategies may lead to more groups venturing into computational design, which may result in synergies from artificial intelligence/machine learning (AI/ML) to phage display and screening. Importantly, the beginner is expected to be able to design their first peptide ligand and begin their journey in peptide drug discovery. Generally, these peptides potentially could be used to interact with any enzyme or receptor, for example, in the study of chemokines and their interactions with glycosoaminoglycans and their receptors.

Exploiting reverse vaccinology approach for the design of a multiepitope subunit vaccine against the major SARS-CoV-2 variants

The current COVID-19 pandemic, an infectious disease caused by the novel coronavirus (SARS-CoV-2), poses a threat to global health because of its high rate of spread and death. Currently, vaccination is the most effective method to prevent the spread of this disease. In the present study, we developed a novel multiepitope vaccine against SARS-CoV-2 containing Alpha (B.1.1.7), Beta (B.1.351), Gamma (P.1), Delta (B.1.617.2), and Omicron (BA.1) variants. To this end, we performed a robust immunoinformatics approach based on multiple epitopes of the four structural proteins of SARS-CoV-2 (S, M, N, and E) from 475 SARS-CoV-2 genomes sequenced from the regions with the highest number of registered cases, namely the United States, India, Brazil, France, Germany, and the United Kingdom. To investigate the best immunogenic epitopes for linear B cells, cytotoxic T lymphocytes (CTL), and helper T lymphocytes (HTL), we evaluated antigenicity, allergenicity, conservation, immunogenicity, toxicity, human population coverage, IFN-inducing, post-translational modifications, and physicochemical properties. The tertiary structure of a vaccine prototype was predicted, refined, and validated. Through docking experiments, we evaluated its molecular coupling to the key immune receptor Toll-Like Receptor 3 (TLR3). To improve the quality of docking calculations, quantum mechanics/molecular mechanics calculations (QM/MM) were used, with the QM part of the simulations performed using the density functional theory formalism (DFT). Cloning and codon optimization were performed for the successful expression of the vaccine in E. coli. Finally, we investigated the immunogenic properties and immune response of our SARS-CoV-2 multiepitope vaccine. The results of the simulations show that administering our prototype three times significantly increases the antibody response and decreases the amount of antigens. The proposed vaccine candidate should therefore be tested in clinical trials for its efficacy in neutralizing SARS-CoV-2.

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.

Docking-based long timescale simulation of cell-size protein systems at atomic resolution

Advances in computational modeling have led to an increasing focus on larger biomolecular systems, up to the level of a cell. Protein interactions are a central component of cellular processes. Techniques for modeling protein interactions have been divided between two fields: protein docking (predicting the static structures of protein complexes) and molecular simulation (modeling the dynamics of protein association, for relatively short simulation times at atomic resolution). Our study combined the two approaches to reach very long simulation times. The study makes the model more adequate to the real cells, to explore cellular processes at atomic resolution to better understand molecular mechanisms of life, and to use this knowledge to improve our ability to treat diseases.

Computational methodologies are increasingly addressing modeling of the whole cell at the molecular level. Proteins and their interactions are the key component of cellular processes. Techniques for modeling protein interactions, thus far, have included protein docking and molecular simulation. The latter approaches account for the dynamics of the interactions but are relatively slow, if carried out at all-atom resolution, or are significantly coarse grained. Protein docking algorithms are far more efficient in sampling spatial coordinates. However, they do not account for the kinetics of the association (i.e., they do not involve the time coordinate). Our proof-of-concept study bridges the two modeling approaches, developing an approach that can reach unprecedented simulation timescales at all-atom resolution. The global intermolecular energy landscape of a large system of proteins was mapped by the pairwise fast Fourier transform docking and sampled in space and time by Monte Carlo simulations. The simulation protocol was parametrized on existing data and validated on a number of observations from experiments and molecular dynamics simulations. The simulation protocol performed consistently across very different systems of proteins at different protein concentrations. It recapitulated data on the previously observed protein diffusion rates and aggregation. The speed of calculation allows reaching second-long trajectories of protein systems that approach the size of the cells, at atomic resolution.

Benchmarking AlphaFold for protein complex modeling reveals accuracy determinants

High‐resolution experimental structural determination of protein–protein interactions has led to valuable mechanistic insights, yet due to the massive number of interactions and experimental limitations there is a need for computational methods that can accurately model their structures. Here we explore the use of the recently developed deep learning method, AlphaFold, to predict structures of protein complexes from sequence. With a benchmark of 152 diverse heterodimeric protein complexes, multiple implementations and parameters of AlphaFold were tested for accuracy. Remarkably, many cases (43%) had near‐native models (medium or high critical assessment of predicted interactions accuracy) generated as top‐ranked predictions by AlphaFold, greatly surpassing the performance of unbound protein–protein docking (9% success rate for near‐native top‐ranked models), however AlphaFold modeling of antibody–antigen complexes within our set was unsuccessful. We identified sequence and structural features associated with lack of AlphaFold success, and we also investigated the impact of multiple sequence alignment input. Benchmarking of a multimer‐optimized version of AlphaFold (AlphaFold‐Multimer) with a set of recently released antibody–antigen structures confirmed a low rate of success for antibody–antigen complexes (11% success), and we found that T cell receptor–antigen complexes are likewise not accurately modeled by that algorithm, showing that adaptive immune recognition poses a challenge for the current AlphaFold algorithm and model. Overall, our study demonstrates that end‐to‐end deep learning can accurately model many transient protein complexes, and highlights areas of improvement for future developments to reliably model any protein–protein interaction of interest.

Anti-breast Adenocarcinoma and Anti-urease Anti-tyrosinase Properties of 5-Pentylresorcinol as Natural Compound with Molecular Docking Studies

5-Pentylresorcinol is a type of the group of resorcinol compounds that is resorcinol in that has hydrogen atom at position 5 is replaced by a pentyl group. It has a role as a lichen metabolite. This compound showed excellent to good inhibitory activities against studied these enzymes with IC₅₀ values of 65.96 µM for urease and 34.81 µM for tyrosinase. Standard compounds for enzymes had IC₅₀ values of 1.94±0.24 µM against urease and 84.36±5.17 µM against tyrosinase. The IC₅₀ of 5-pentylresorcinol against MCF7 cell line was 165.72 µg/mL; against Hs 578Bst cell line was 102.14 µg/mL; against Hs 319.T cell line was 12.34 µg/mL; and against UACC-3133 cell line was 73.07 µg/mL, respectively. The chemical activities of 5-pentylresorcinol against urease and tyrosinase were evaluated using the molecular modeling study. The anti-cancer activity of 5-pentylresorcinol was also investigated by treating the compound on the BRCT repeat region from the breast cancer-associated protein (BRCA1), and their interactions were assessed utilizing the molecular docking calculations. The results revealed the probable interactions and their characteristics at an atomic level. The docking scores of 5-pentylresorcinol against urease, tyrosinase, and BRCA1 are -3.073, -5.262, and -3.238 (kcal/mol), respectively.

Induced fit with replica exchange improves protein complex structure prediction

Despite the progress in prediction of protein complexes over the last decade, recent blind protein complex structure prediction challenges revealed limited success rates (less than 20% models with DockQ score > 0.4) on targets that exhibit significant conformational change upon binding. To overcome limitations in capturing backbone motions, we developed a new, aggressive sampling method that incorporates temperature replica exchange Monte Carlo (T-REMC) and conformational sampling techniques within docking protocols in Rosetta. Our method, ReplicaDock 2.0, mimics induced-fit mechanism of protein binding to sample backbone motions across putative interface residues on-the-fly, thereby recapitulating binding-partner induced conformational changes. Furthermore, ReplicaDock 2.0 clocks in at 150-500 CPU hours per target (protein-size dependent); a runtime that is significantly faster than Molecular Dynamics based approaches. For a benchmark set of 88 proteins with moderate to high flexibility (unbound-to-bound iRMSD over 1.2 Å), ReplicaDock 2.0 successfully docks 61% of moderately flexible complexes and 35% of highly flexible complexes. Additionally, we demonstrate that by biasing backbone sampling particularly towards residues comprising flexible loops or hinge domains, highly flexible targets can be predicted to under 2 Å accuracy. This indicates that additional gains are possible when mobile protein segments are known.

Computational vaccinology guided design of multi-epitope subunit vaccine against a neglected arbovirus of the Americas

Mayaro virus (MAYV) is an arbovirus found in the Americas that can cause debilitating arthritogenic disease. Although it is an emerging virus, the only current approach is vector control, as there are no approved vaccines to prevent MAYV infection nor therapeutics to treat it. In search of an effective vaccine candidate against MAYV, we used immunoinformatics and molecular modeling to attempt to identify promiscuous T-cell epitopes of the nonstructural polyproteins (nsP1, nsP2, nsP3, and nsP4) from 127 MAYV genomes sequenced in the Americas (08 Bolivia, 72 Brazil, 04 French Guiana, 05 Haiti, 20 Peru, 04 Trinidad and Tobago, and 14 Venezuela). For this purpose, consensus sequences of 360 proteins were used to identify short protein sequences that can bind to MHC I class (MHC II). Our analysis revealed 56 potential MHC-I/TCD8+ (29 MHC-II/TCD4+) epitopes, but only 6 (16) TCD8+ (TCD4+) epitopes showed high antigenicity and conservation, non-allergenicity, non-toxicity, and excellent population coverage. Finally, classical and quantum mechanical calculations (QM:MM) were used to improve the quality of the docking calculations, with the QM part of the simulations performed using the density functional theory formalism (DFT). These results provide insights for the advancement of diagnostic platforms, vaccine development, and immunotherapeutic interventions.Communicated by Ramaswamy H. Sarma.

Modeling the Dynamics of Protein-Protein Interfaces, How and Why?

Protein-protein assemblies act as a key component in numerous cellular processes. Their accurate modeling at the atomic level remains a challenge for structural biology. To address this challenge, several docking and a handful of deep learning methodologies focus on modeling protein-protein interfaces. Although the outcome of these methods has been assessed using static reference structures, more and more data point to the fact that the interaction stability and specificity is encoded in the dynamics of these interfaces. Therefore, this dynamics information must be taken into account when modeling and assessing protein interactions at the atomistic scale. Expanding on this, our review initially focuses on the recent computational strategies aiming at investigating protein-protein interfaces in a dynamic fashion using enhanced sampling, multi-scale modeling, and experimental data integration. Then, we discuss how interface dynamics report on the function of protein assemblies in globular complexes, in fuzzy complexes containing intrinsically disordered proteins, as well as in active complexes, where chemical reactions take place across the protein-protein interface.

A random forest classifier for protein-protein docking models

Herein, we present the results of a machine learning approach we developed to single out correct 3D docking models of protein-protein complexes obtained by popular docking software. To this aim, we generated 3 × 10 4 docking models for each of the 230 complexes in the protein-protein benchmark, version 5, using three different docking programs (HADDOCK, FTDock and ZDOCK), for a cumulative set of ≈ 7 × 10 6 docking models. Three different machine learning approaches (Random Forest, Supported Vector Machine and Perceptron) were used to train classifiers with 158 different scoring functions (features). The Random Forest algorithm outperformed the other two algorithms and was selected for further optimization. Using a features selection algorithm, and optimizing the random forest hyperparameters, allowed us to train and validate a random forest classifier, named COnservation Driven Expert System (CoDES). Testing of CoDES on independent datasets, as well as results of its comparative performance with machine learning methods recently developed in the field for the scoring of docking decoys, confirm its state-of-the-art ability to discriminate correct from incorrect decoys both in terms of global parameters and in terms of decoys ranked at the top positions.

Supplementary information

Supplementary data are available at Bioinformatics Advances online.

Software and data availability statement

The docking models are available at https://doi.org/10.5281/zenodo.4012018. The programs underlying this article will be shared on request to the corresponding authors.

Protein-Protein Docking: Past, Present, and Future

The biological significance of proteins attracted the scientific community in exploring their characteristics. The studies shed light on the interaction patterns and functions of proteins in a living body. Due to their practical difficulties, reliable experimental techniques pave the way for introducing computational methods in the interaction prediction. Automated methods reduced the difficulties but could not yet replace experimental studies as the field is still evolving. Interaction prediction problem being critical needs highly accurate results, but none of the existing methods could offer reliable performance that can parallel with experimental results yet. This article aims to assess the existing computational docking algorithms, their challenges, and future scope. Blind docking techniques are quite helpful when no information other than the individual structures are available. As more and more complex structures are being added to different databases, information-driven approaches can be a good alternative. Artificial intelligence, ruling over the major fields, is expected to take over this domain very shortly.

Colicin-Mediated Transport of DNA through the Iron Transporter FepA

Colicins are protein antibiotics deployed by Escherichia coli to eliminate competing strains. Colicins frequently exploit outer membrane (OM) nutrient transporters to penetrate the selectively permeable bacterial cell envelope. Here, by applying live-cell fluorescence imaging, we were able to monitor the entry of the pore-forming toxin colicin B (ColB) into E. coli and localize it within the periplasm. We further demonstrate that single-stranded DNA coupled to ColB can also be transported to the periplasm, emphasizing that the import routes of colicins can be exploited to carry large cargo molecules into bacteria. Moreover, we characterize the molecular mechanism of ColB association with its OM receptor FepA by applying a combination of photoactivated cross-linking, mass spectrometry, and structural modeling. We demonstrate that complex formation is coincident with large-scale conformational changes in the colicin. Thereafter, active transport of ColB through FepA involves the colicin taking the place of the N-terminal half of the plug domain that normally occludes this iron transporter. IMPORTANCE Decades of excessive use of readily available antibiotics has generated a global problem of antibiotic resistance and, hence, an urgent need for novel antibiotic solutions. Bacteriocins are protein-based antibiotics produced by bacteria to eliminate closely related competing bacterial strains. Bacteriocin toxins have evolved to bypass the complex cell envelope in order to kill bacterial cells. Here, we uncover the cellular penetration mechanism of a well-known but poorly understood bacteriocin called colicin B that is active against Escherichia coli. Moreover, we demonstrate that the colicin B-import pathway can be exploited to deliver conjugated DNA cargo into bacterial cells. Our work leads to a better understanding of the way bacteriocins, as potential alternative antibiotics, execute their mode of action as well as highlighting how they might even be exploited in the genomic manipulation of Gram-negative bacteria.

Protein-protein interactions at a glance: Protocols for the visualization of biomolecular interactions

Protein-protein interactions (PPIs) play a key role in many biological processes and are intriguing targets for drug discovery campaigns. Advancements in experimental and computational techniques are leading to a growth of data accessibility, and, with it, an increased need for the analysis of PPIs. In this respect, visualization tools are essential instruments to represent and analyze biomolecular interactions. In this chapter, we reviewed some of the available tools, highlighting their features, and describing their functions with practical information on their usage.

Phosphate binding sites prediction in phosphorylation-dependent protein-protein interactions

MOTIVATION

Phosphate binding plays an important role in modulating protein-protein interactions, which are ubiquitous in various biological processes. Accurate prediction of phosphate binding sites is an important but challenging task. Small size and diversity of phosphate binding sites lead to a substantial challenge for developing accurate prediction methods.

RESULTS

Here we present the phosphate binding site predictor (PBSP), a novel and accurate approach to identifying phosphate binding sites from protein structures. PBSP combines an energy-based ligand-binding sites identification method with reverse focused docking using a phosphate probe. We show that PBSP outperforms not only general ligand binding sites predictors but also other existing phospholigand-specific binding sites predictors. It achieves ∼95% success rate for top 10 predicted sites with an average Matthews correlation coefficient (MCC) value of 0.84 for successful predictions. PBSP can accurately predict phosphate binding modes, with average position error of 1.4 Å and 2.4 Å in bound and unbound datasets, respectively. Lastly, visual inspection of the predictions is conducted. Reasons for failed predictions are further analyzed and possible ways to improve the performance are provided. These results demonstrate a novel and accurate approach to phosphate binding sites identification in protein structures.

AVAILABILITY

The software and benchmark datasets are freely available at http://web.pkusz.edu.cn/wu/PBSP/.

SUPPLEMENTARY INFORMATION

Supplementary data are available at Bioinformatics online.

Protein-Protein Docking with Large-Scale Backbone Flexibility Using Coarse-Grained Monte-Carlo Simulations

Most of the protein–protein docking methods treat proteins as almost rigid objects. Only the side-chains flexibility is usually taken into account. The few approaches enabling docking with a flexible backbone typically work in two steps, in which the search for protein–protein orientations and structure flexibility are simulated separately. In this work, we propose a new straightforward approach for docking sampling. It consists of a single simulation step during which a protein undergoes large-scale backbone rearrangements, rotations, and translations. Simultaneously, the other protein exhibits small backbone fluctuations. Such extensive sampling was possible using the CABS coarse-grained protein model and Replica Exchange Monte Carlo dynamics at a reasonable computational cost. In our proof-of-concept simulations of 62 protein–protein complexes, we obtained acceptable quality models for a significant number of cases.

Development and Evaluation of GlycanDock: A Protein-Glycoligand Docking Refinement Algorithm in Rosetta

Carbohydrate chains are ubiquitous in the complex molecular processes of life. These highly diverse chains are recognized by a variety of protein receptors, enabling glycans to regulate many biological functions. High-resolution structures of protein-glycoligand complexes reveal the atomic details necessary to understand this level of molecular recognition and inform application-focused scientific and engineering pursuits. When experimental challenges hinder high-throughput determination of quality structures, computational tools can, in principle, fill the gap. In this work, we introduce GlycanDock, a residue-centric protein-glycoligand docking refinement algorithm developed within the Rosetta macromolecular modeling and design software suite. We performed a benchmark docking assessment using a set of 109 experimentally determined protein-glycoligand complexes as well as 62 unbound protein structures. The GlycanDock algorithm can sample and discriminate among protein-glycoligand models of native-like structural accuracy with statistical reliability from starting structures of up to 7 Å root-mean-square deviation in the glycoligand ring atoms. We show that GlycanDock-refined models qualitatively replicated the known binding specificity of a bacterial carbohydrate-binding module. Finally, we present a protein-glycoligand docking pipeline for generating putative protein-glycoligand complexes when only the glycoligand sequence and unbound protein structure are known. In combination with other carbohydrate modeling tools, the GlycanDock docking refinement algorithm will accelerate research in the glycosciences.