refineD: improved protein structure refinement using machine learning based restrained relaxation

iQDeep: an integrated web server for protein scoring using multiscale deep learning models

The remarkable recent advances in protein structure prediction have enabled computational modeling of protein structures with considerably higher accuracy than ever before. While state-of-the-art structure prediction methods provide self-assessment confidence scores of their own predictions, an independent and open-access system for protein scoring is still needed that can be applied to a broad range of predictive modeling scenarios. Here, we present iQDeep, an integrated and highly customizable web server for protein scoring, freely available at http://fusion.cs.vt.edu/iQDeep. The underlying method of iQDeep employs multiscale deep residual neural networks (ResNets) to perform residue-level error classifications, and then probabilistically combines the error classifications for protein scoring. By adjusting the error resolutions, our method can reliably estimate the standard- or high-accuracy variants of the Global Distance Test metric for versatile protein scoring. The performance of the method has been extensively tested and compared against the state-of-the-art approaches in multiple rounds of Critical Assessment of Techniques for Protein Structure Prediction (CASP) experiments including benchmark assessment in CASP12 and CASP13 as well as blind evaluation in CASP14. The iQDeep web server offers a number of convenient features, including (i) the choice of individual and batch processing modes; (ii) an interactive and privacy-preserving web interface for automated job submission, tracking, and results retrieval; (iii) web-based quantitative and visual analyses of the results including overall estimated score and its residue-wise breakdown along with agreements between various sequence- and structural-level features; (iv) extensive help information on job submission and results interpretation via web-based tutorial and help tooltips.

Solvent Accessibility Promotes Rotamer Errors during Protein Modeling with Major Side-Chain Prediction Programs

Side-chain rotamer prediction is one of the most critical late stages in protein 3D structure building. Highly advanced and specialized algorithms (e.g., FASPR, RASP, SCWRL4, and SCWRL4v) optimize this process by use of rotamer libraries, combinatorial searches, and scoring functions. We seek to identify the sources of key rotamer errors as a basis for correcting and improving the accuracy of protein modeling going forward. In order to evaluate the aforementioned programs, we process 2496 high-quality single-chained all-atom filtered 30% homology protein 3D structures and use discretized rotamer analysis to compare original with calculated structures. Among 513,024 filtered residue records, increased amino acid residue-dependent rotamer errors─associated in particular with polar and charged amino acid residues (ARG, LYS, and GLN)─clearly correlate with increased amino acid residue solvent accessibility and an increased residue tendency toward the adoption of non-canonical off rotamers which modeling programs struggle to predict accurately. Understanding the impact of solvent accessibility now appears key to improved side-chain prediction accuracies.

An immunoinformatics analysis: design of a multi-epitope vaccine against Cryptosporidium hominis by employing heat shock protein triggers the innate and adaptive immune responses

Cryptosporidium hominis, an anthropologically transferred species in the Cryptosporidium genus, represents many clinical studies in several countries. Its growth in the recent decade is primarily owing to epidemiologic studies. This parasite has complicated life cycles that require differentiation through a variety of phases of development and passage across two or more hosts throughout their lifetimes. As they move from host to host and environment to environment, pathogenic organisms are continually exposed to unexpected changes in the circumstances under which they develop. Heat shock proteins (HSPs) are targets of the host immune response; they are involved in the progression of diseases and play a significant part in this process. It has been discovered that the immunodominant immunogenic antigens in parasite infections HSPs. In this study, we have generated a multi-epitope vaccine against Cryptosporidium hominis (C. hominis) by using heat shock proteins. The epitopes that were selected had a substantial binding affinity for the B- and T-cell reference set of alleles, a high antigenicity score, a nature that was not allergic, a high solubility, non-toxicity and good binders. The epitopes were incorporated into a chimeric vaccine by using appropriate linkers. In order to increase the immunogenicity of the connected epitopes and effectively activate both innate and adaptive immunity, an adjuvant was attached to the epitopes. We have also analyzed the physiochemical characteristics of the vaccine which were satisfactory and then lead to the development of a 3D model. In addition, the binding confirmation of the vaccine to the TLR-4 innate immune receptor was also determined using molecular docking and molecular dynamics (MD) simulation. The results of this simulation show that the vaccine has a strong binding affinity for TLR4, which indicates that the vaccine is highly effective. In general, the vaccine that has been described here has a good potential for inducing protective and targeted immunogenicity, however, this hypothesis is contingent upon more experimental testing.Communicated by Ramaswamy H. Sarma.

Contact-Assisted Threading in Low-Homology Protein Modeling

The ability to successfully predict the three-dimensional structure of a protein from its amino acid sequence has made considerable progress in the recent past. The progress is propelled by the improved accuracy of deep learning-based inter-residue contact map predictors coupled with the rising growth of protein sequence databases. Contact map encodes interatomic interaction information that can be exploited for highly accurate prediction of protein structures via contact map threading even for the query proteins that are not amenable to direct homology modeling. As such, contact-assisted threading has garnered considerable research effort. In this chapter, we provide an overview of existing contact-assisted threading methods while highlighting the recent advances and discussing some of the current limitations and future prospects in the application of contact-assisted threading for improving the accuracy of low-homology protein modeling.

A novel strategy for developing vaccine candidate against Jaagsiekte sheep retrovirus from the envelope and gag proteins: an in-silico approach

BACKGROUND

Sheep pulmonary adenocarcinoma (OPA) is a contagious lung cancer of sheep caused by the Jaagsiekte retrovirus (JSRV). OPA typically has a serious economic impact worldwide. A vaccine has yet to be developed, even though the disease has been globally spread, along with its complications. This study aimed to construct an effective multi-epitopes vaccine against JSRV eliciting B and T lymphocytes using immunoinformatics tools.

RESULTS

The designed vaccine was composed of 499 amino acids. Before the vaccine was computationally validated, all critical parameters were taken into consideration; including antigenicity, allergenicity, toxicity, and stability. The physiochemical properties of the vaccine displayed an isoelectric point of 9.88. According to the Instability Index (II), the vaccine was stable at 28.28. The vaccine scored 56.51 on the aliphatic index and -0.731 on the GRAVY, indicating that the vaccine was hydrophilic. The RaptorX server was used to predict the vaccine's tertiary structure, the GalaxyWEB server refined the structure, and the Ramachandran plot and the ProSA-web server validated the vaccine's tertiary structure. Protein-sol and the SOLPro servers showed the solubility of the vaccine. Moreover, the high mobile regions in the vaccine's structure were reduced and the vaccine's stability was improved by disulfide engineering. Also, the vaccine construct was docked with an ovine MHC-1 allele and showed efficient binding energy. Immune simulation remarkably showed high levels of immunoglobulins, T lymphocytes, and INF-γ secretions. The molecular dynamic simulation provided the stability of the constructed vaccine. Finally, the vaccine was back-transcribed into a DNA sequence and cloned into a pET-30a ( +) vector to affirm the potency of translation and microbial expression.

CONCLUSION

A novel multi-epitopes vaccine construct against JSRV, was formed from B and T lymphocytes epitopes, and was produced with potential protection. This study might help in controlling and eradicating OPA.

Capturing the potential energy landscape of large size molecular clusters from atomic interactions up to a 4-body system using deep learning

We propose a new method that utilizes the database of stable conformers and borrow the fragmentation concept of many-body-expansion (MBE) methods in ab initio methods to train a deep-learning machine learning (ML) model using SchNet.

Benchmarking of structure refinement methods for protein complex models

Protein structure docking is the process in which the quaternary structure of a protein complex is predicted from individual tertiary structures of the protein subunits. Protein docking is typically performed in two main steps. The subunits are first docked while keeping them rigid to form the complex, which is then followed by structure refinement. Structure refinement is crucial for a practical use of computational protein docking models, as it is aimed for correcting conformations of interacting residues and atoms at the interface. Here, we benchmarked the performance of eight existing protein structure refinement methods in refinement of protein complex models. We show that the fraction of native contacts between subunits is by far the most straightforward metric to improve. However, backbone dependent metrics, based on the Root Mean Square Deviation proved more difficult to improve via refinement.

Proteomic Tools for the Analysis of Cytoskeleton Proteins

Proteomic analyses have become an essential part of the toolkit of the molecular biologist, given the widespread availability of genomic data and open source or freely accessible bioinformatics software. Tools are available for detecting homologous sequences, recognizing functional domains, and modeling the three-dimensional structure for any given protein sequence, as well as for predicting interactions with other proteins or macromolecules. Although a wealth of structural and functional information is available for many cytoskeletal proteins, with representatives spanning all of the major subfamilies, the majority of cytoskeletal proteins remain partially or totally uncharacterized. Moreover, bioinformatics tools provide a means for studying the effects of synthetic mutations or naturally occurring variants of these cytoskeletal proteins. This chapter discusses various freely available proteomic analysis tools, with a focus on in silico prediction of protein structure and function. The selected tools are notable for providing an easily accessible interface for the novice while retaining advanced functionality for more experienced computational biologists.

Protein sequence-to-structure learning: Is this the end(-to-end revolution)?

The potential of deep learning has been recognized in the protein structure prediction community for some time, and became indisputable after CASP13. In CASP14, deep learning has boosted the field to unanticipated levels reaching near-experimental accuracy. This success comes from advances transferred from other machine learning areas, as well as methods specifically designed to deal with protein sequences and structures, and their abstractions. Novel emerging approaches include (i) geometric learning, that is, learning on representations such as graphs, three-dimensional (3D) Voronoi tessellations, and point clouds; (ii) pretrained protein language models leveraging attention; (iii) equivariant architectures preserving the symmetry of 3D space; (iv) use of large meta-genome databases; (v) combinations of protein representations; and (vi) finally truly end-to-end architectures, that is, differentiable models starting from a sequence and returning a 3D structure. Here, we provide an overview and our opinion of the novel deep learning approaches developed in the last 2 years and widely used in CASP14.

Rosetta:MSF:NN: Boosting performance of multi-state computational protein design with a neural network

Rational protein design aims at the targeted modification of existing proteins. To reach this goal, software suites like Rosetta propose sequences to introduce the desired properties. Challenging design problems necessitate the representation of a protein by means of a structural ensemble. Thus, Rosetta multi-state design (MSD) protocols have been developed wherein each state represents one protein conformation. Computational demands of MSD protocols are high, because for each of the candidate sequences a costly three-dimensional (3D) model has to be created and assessed for all states. Each of these scores contributes one data point to a complex, design-specific energy landscape. As neural networks (NN) proved well-suited to learn such solution spaces, we integrated one into the framework Rosetta:MSF instead of the so far used genetic algorithm with the aim to reduce computational costs. As its predecessor, Rosetta:MSF:NN administers a set of candidate sequences and their scores and scans sequence space iteratively. During each iteration, the union of all candidate sequences and their Rosetta scores are used to re-train NNs that possess a design-specific architecture. The enormous speed of the NNs allows an extensive assessment of alternative sequences, which are ranked on the scores predicted by the NN. Costly 3D models are computed only for a small fraction of best-scoring sequences; these and the corresponding 3D-based scores replace half of the candidate sequences during each iteration. The analysis of two sets of candidate sequences generated for a specific design problem by means of a genetic algorithm confirmed that the NN predicted 3D-based scores quite well; the Pearson correlation coefficient was at least 0.95. Applying Rosetta:MSF:NN:enzdes to a benchmark consisting of 16 ligand-binding problems showed that this protocol converges ten-times faster than the genetic algorithm and finds sequences with comparable scores.

DeepRefiner: high-accuracy protein structure refinement by deep network calibration

The DeepRefiner webserver, freely available at http://watson.cse.eng.auburn.edu/DeepRefiner/, is an interactive and fully configurable online system for high-accuracy protein structure refinement. Fuelled by deep learning, DeepRefiner offers the ability to leverage cutting-edge deep neural network architectures which can be calibrated for on-demand selection of adventurous or conservative refinement modes targeted at degree or consistency of refinement. The method has been extensively tested in the Critical Assessment of Techniques for Protein Structure Prediction (CASP) experiments under the group name 'Bhattacharya-Server' and was officially ranked as the No. 2 refinement server in CASP13 (second only to 'Seok-server' and outperforming all other refinement servers) and No. 2 refinement server in CASP14 (second only to 'FEIG-S' and outperforming all other refinement servers including 'Seok-server'). The DeepRefiner web interface offers a number of convenient features, including (i) fully customizable refinement job submission and validation; (ii) automated job status update, tracking, and notifications; (ii) interactive and interpretable web-based results retrieval with quantitative and visual analysis and (iv) extensive help information on job submission and results interpretation via web-based tutorial and help tooltips.

Fast and effective protein model refinement using deep graph neural networks

Protein model refinement is the last step applied to improve the quality of a predicted protein model. Currently the most successful refinement methods rely on extensive conformational sampling and thus, take hours or days to refine even a single protein model. Here we propose a fast and effective model refinement method that applies GNN (graph neural networks) to predict refined inter-atom distance probability distribution from an initial model and then rebuilds 3D models from the predicted distance distribution. Tested on the CASP (Critical Assessment of Structure Prediction) refinement targets, our method has comparable accuracy as two leading human groups Feig and Baker, but runs substantially faster. Our method may refine one protein model within ~11 minutes on 1 CPU while Baker needs ~30 hours on 60 CPUs and Feig needs ~16 hours on 1 GPU. Finally, our study shows that GNN outperforms ResNet (convolutional residual neural networks) for model refinement when very limited conformational sampling is allowed.

Recent Advances in Protein Homology Detection Propelled by Inter-Residue Interaction Map Threading

Sequence-based protein homology detection has emerged as one of the most sensitive and accurate approaches to protein structure prediction. Despite the success, homology detection remains very challenging for weakly homologous proteins with divergent evolutionary profile. Very recently, deep neural network architectures have shown promising progress in mining the coevolutionary signal encoded in multiple sequence alignments, leading to reasonably accurate estimation of inter-residue interaction maps, which serve as a rich source of additional information for improved homology detection. Here, we summarize the latest developments in protein homology detection driven by inter-residue interaction map threading. We highlight the emerging trends in distant-homology protein threading through the alignment of predicted interaction maps at various granularities ranging from binary contact maps to finer-grained distance and orientation maps as well as their combination. We also discuss some of the current limitations and possible future avenues to further enhance the sensitivity of protein homology detection.

A hijack mechanism of Indian SARS-CoV-2 isolates for relapsing contemporary antiviral therapeutics

Coronavirus disease (COVID-19) rapidly expands to a global pandemic and its impact on public health varies from country to country. It is caused by a new virus severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2). It is imperative for relapsing current antiviral therapeutics owing to randomized genetic drift in global SARS-CoV-2 isolates. A molecular mechanism behind the emerging genomic variants is not yet understood for the prioritization of selective antivirals. The present computational study was aimed to repurpose existing antivirals for Indian SARS-CoV-2 isolates by uncovering a hijack mechanism based on structural and functional characteristics of protein variants. Forty-one protein mutations were identified in 12 Indian SARS-CoV-2 isolates by analysis of genome variations across 460 genome sequences obtained from 30 geographic sites in India. Two unique mutations such as W6152R and N5928H found in exonuclease of Surat (GBRC275b) and Gandhinagar (GBRC239) isolates. We report for the first time the impact of folding rate on stabilizing/retaining a sequence-structure-function-virulence link of emerging protein variants leading to accommodate hijack ability from current antivirals. Binding affinity analysis revealed the effect of point mutations on virus infectivity and the drug-escaping efficiency of Indian isolates. Emodin and artinemol suggested herein as repurposable antivirals for the treatment of COVID-19 patients infected with Indian isolates. Our study concludes that a protein folding rate is a key structural and evolutionary determinant to enhance the receptor-binding specificity and ensure hijack ability from the prevalent antiviral therapeutics.

Improved protein structure refinement guided by deep learning based accuracy estimation

We develop a deep learning framework (DeepAccNet) that estimates per-residue accuracy and residue-residue distance signed error in protein models and uses these predictions to guide Rosetta protein structure refinement. The network uses 3D convolutions to evaluate local atomic environments followed by 2D convolutions to provide their global contexts and outperforms other methods that similarly predict the accuracy of protein structure models. Overall accuracy predictions for X-ray and cryoEM structures in the PDB correlate with their resolution, and the network should be broadly useful for assessing the accuracy of both predicted structure models and experimentally determined structures and identifying specific regions likely to be in error. Incorporation of the accuracy predictions at multiple stages in the Rosetta refinement protocol considerably increased the accuracy of the resulting protein structure models, illustrating how deep learning can improve search for global energy minima of biomolecules.

Teaching virtual protein-centric CUREs and UREs using computational tools

Readily available, free, computational approaches, adaptable for topics accessible for first to senior year classes and individual research projects, emphasizing contributions of noncovalent interactions to structure, binding and catalysis were used to teach Course-based Undergraduate Research Experiences that fulfil generally accepted main CURE components: Scientific Background, Hypothesis Development, Proposal, Experiments, Teamwork, Data Analysis of quantitative data, Conclusions, and Presentation.

GalaxyRefine2: simultaneous refinement of inaccurate local regions and overall protein structure

The 3D structure of a protein can be predicted from its amino acid sequence with high accuracy for a large fraction of cases because of the availability of large quantities of experimental data and the advance of computational algorithms. Recently, deep learning methods exploiting the coevolution information obtained by comparing related protein sequences have been successfully used to generate highly accurate model structures even in the absence of template structure information. However, structures predicted based on either template structures or related sequences require further improvement in regions for which information is missing. Refining a predicted protein structure with insufficient information on certain regions is critical because these regions may be connected to functional specificity that is not conserved among related proteins. The GalaxyRefine2 web server, freely available via http://galaxy.seoklab.org/refine2, is an upgraded version of the GalaxyRefine protein structure refinement server and reflects recent developments successfully tested through CASP blind prediction experiments. This method adopts an iterative optimization approach involving various structure move sets to refine both local and global structures. The estimation of local error and hybridization of available homolog structures are also employed for effective conformation search.

Neighborhood Preference of Amino Acids in Protein Structures and its Applications in Protein Structure Assessment

Amino acids form protein 3D structures in unique manners such that the folded structure is stable and functional under physiological conditions. Non-specific and non-covalent interactions between amino acids exhibit neighborhood preferences. Based on structural information from the protein data bank, a statistical energy function was derived to quantify amino acid neighborhood preferences. The neighborhood of one amino acid is defined by its contacting residues, and the energy function is determined by the neighboring residue types and relative positions. The neighborhood preference of amino acids was exploited to facilitate structural quality assessment, which was implemented in the neighborhood preference program NEPRE. The source codes are available via https://github.com/LiuLab-CSRC/NePre.

Computational reconstruction of atomistic protein structures from coarse-grained models

Three-dimensional protein structures, whether determined experimentally or theoretically, are often too low resolution. In this mini-review, we outline the computational methods for protein structure reconstruction from incomplete coarse-grained to all atomistic models. Typical reconstruction schemes can be divided into four major steps. Usually, the first step is reconstruction of the protein backbone chain starting from the C-alpha trace. This is followed by side-chains rebuilding based on protein backbone geometry. Subsequently, hydrogen atoms can be reconstructed. Finally, the resulting all-atom models may require structure optimization. Many methods are available to perform each of these tasks. We discuss the available tools and their potential applications in integrative modeling pipelines that can transfer coarse-grained information from computational predictions, or experiment, to all atomistic structures.

High-accuracy refinement using Rosetta in CASP13

Because proteins generally fold to their lowest free energy states, energy-guided refinement in principle should be able to systematically improve the quality of protein structure models generated using homologous structure or co-evolution derived information. However, because of the high dimensionality of the search space, there are far more ways to degrade the quality of a near native model than to improve it, and hence, refinement methods are very sensitive to energy function errors. In the 13th Critial Assessment of techniques for protein Structure Prediction (CASP13), we sought to carry out a thorough search for low energy states in the neighborhood of a starting model using restraints to avoid straying too far. The approach was reasonably successful in improving both regions largely incorrect in the starting models as well as core regions that started out closer to the correct structure. Models with GDT-HA over 70 were obtained for five targets and for one of those, an accuracy of 0.5 å backbone root-mean-square deviation (RMSD) was achieved. An important current challenge is to improve performance in refining oligomers and larger proteins, for which the search problem remains extremely difficult.