MOTIVATION: An accurate estimation of the quality of protein model structures typifies as a cornerstone in protein structure prediction regimes. Despite the recent groundbreaking success in the field of protein structure prediction, there are certain prospects for the improvement in model quality estimation at multiple stages of protein structure prediction and thus, to further push the prediction accuracy. Here, a novel approach, named ProFitFun, for assessing the quality of protein models is proposed by harnessing the sequence and structural features of experimental protein structures in terms of the preferences of backbone dihedral angles and relative surface accessibility of their amino acid residues at the tripeptide level. The proposed approach leverages upon the backbone dihedral angle and surface accessibility preferences of the residues by accounting for its N-terminal and C-terminal neighbors in the protein structure. These preferences are used to evaluate protein structures through a machine learning approach and tested on an extensive dataset of diverse proteins. RESULTS: The approach was extensively validated on a large test dataset (n = 25 005) of protein structures, comprising 23 661 models of 82 non-homologous proteins and 1344 non-homologous experimental structures. In addition, an external dataset of 40 000 models of 200 non-homologous proteins was also used for the validation of the proposed method. Both datasets were further used for benchmarking the proposed method with four different state-of-the-art methods for protein structure quality assessment. In the benchmarking, the proposed method outperformed some state-of-the-art methods in terms of Spearman's and Pearson's correlation coefficients, average GDT-TS loss, sum of z-scores and average absolute difference of predictions over corresponding observed values. The high accuracy of the proposed approach promises a potential use of the sequence and structural features in computational protein design. AVAILABILITY AND IMPLEMENTATION: http://github.com/KYZ-LSB/ProTerS-FitFun. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

Intrinsically disordered regions/proteins (IDRs) are abundant across all the domains of life, where they perform important regulatory roles and supplement the biological functions of structured proteins/regions (SRs). Despite the multifunctionality features of IDRs, several interrogations on the evolution of viral genomic regions encoding IDRs in diverse viral proteins remain unreciprocated. To fill this gap, we benchmarked the findings of two most widely used and reliable intrinsic disorder prediction algorithms (IUPred2A and ESpritz) to a dataset of 6108 reference viral proteomes to unravel the multifaceted evolutionary forces that shape the codon usage in the viral genomic regions encoding for IDRs and SRs. We found persuasive evidence that the natural selection predominantly governs the evolution of codon usage in regions encoding IDRs by most of the viruses. In addition, we confirm not only that codon usage in regions encoding IDRs is less optimized for the protein synthesis machinery (transfer RNAs pool) of their host than for those encoding SRs, but also that the selective constraints imposed by codon bias sustain this reduced optimization in IDRs. Our analysis also establishes that IDRs in viruses are likely to tolerate more translational errors than SRs. All these findings hold true, irrespective of the disorder prediction algorithms used to classify IDRs. In conclusion, our study offers a novel perspective on the evolution of viral IDRs and the evolutionary adaptability to multiple taxonomically divergent hosts.

Interaction of SARS-CoV-2 spike glycoprotein with the ACE2 cell receptor is very crucial for virus attachment to human cells. Selected mutations in SARS-CoV-2 S-protein are reported to strengthen its binding affinity to mammalian ACE2. The N501T mutation in SARS-CoV-2-CTD furnishes better support to hotspot 353 in comparison with SARS-CoV and shows higher affinity for receptor binding. Recombination analysis exhibited higher recombination events in SARS-CoV-2 strains, irrespective of their geographical origin or hosts. Investigation further supports a common origin among SARS-CoV-2 and its predecessors, SARS-CoV and bat-SARS-like-CoV. The recombination events suggest a constant exchange of genetic material among the co-infecting viruses in possible reservoirs and human hosts before SARS-CoV-2 emerged. Furthermore, a comprehensive analysis of codon usage bias (CUB) in SARS-CoV-2 revealed significant CUB among the S-genes of different beta-coronaviruses governed majorly by natural selection and mutation pressure. Various indices of codon usage of S-genes helped in quantifying its adaptability in other animal hosts. These findings might help in identifying potential experimental animal models for investigating pathogenicity for drugs and vaccine development experiments.

Protein engineering and design principles employing the 20 standard amino acids have been extensively used to achieve stable protein scaffolds and deliver their specific activities. Although this confers some advantages, it often restricts the sequence, chemical space, and ultimately the functional diversity of proteins. Moreover, although site-specific incorporation of non-natural amino acids (nnAAs) has been proven to be a valuable strategy in protein engineering and therapeutics development, its utility in the affinity-maturation of nanobodies is not fully explored. Besides, current experimental methods do not routinely employ nnAAs due to their enormous library size and infinite combinations. To address this, we have developed an integrated computational pipeline employing structure-based protein design methodologies, molecular dynamics simulations and free energy calculations, for the binding affinity prediction of an nnAA-incorporated nanobody toward its target and selection of potent binders. We show that by incorporating halogenated tyrosines, the affinity of 9G8 nanobody can be improved toward epidermal growth factor receptor (EGFR), a crucial cancer target. Surface plasmon resonance (SPR) assays showed that the binding of several 3-chloro-l-tyrosine (3MY)-incorporated nanobodies were improved up to 6-fold into a picomolar range, and the computationally estimated binding affinities shared a Pearson's r of 0.87 with SPR results. The improved affinity was found to be due to enhanced van der Waals interactions of key 3MY-proximate nanobody residues with EGFR, and an overall increase in the nanobody's structural stability. In conclusion, we show that our method can facilitate screening large libraries and predict potent site-specific nnAA-incorporated nanobody binders against crucial disease-targets.

MOTIVATION: Structure-based Computational Protein design (CPD) plays a critical role in advancing the field of protein engineering. Using an all-atom energy function, CPD tries to identify amino acid sequences that fold into a target structure and ultimately perform a desired function. Energy functions remain however imperfect and injecting relevant information from known structures in the design process should lead to improved designs. RESULTS: We introduce Shades, a data-driven CPD method that exploits local structural environments in known protein structures together with energy to guide sequence design, while sampling side-chain and backbone conformations to accommodate mutations. Shades (Structural Homology Algorithm for protein DESign), is based on customized libraries of non-contiguous in-contact amino acid residue motifs. We have tested Shades on a public benchmark of 40 proteins selected from different protein families. When excluding homologous proteins, Shades achieved a protein sequence recovery of 30% and a protein sequence similarity of 46% on average, compared with the PFAM protein family of the target protein. When homologous structures were added, the wild-type sequence recovery rate achieved 93%. AVAILABILITY AND IMPLEMENTATION: Shades source code is available at https://bitbucket.org/satsumaimo/shades as a patch for Rosetta 3.8 with a curated protein structure database and ITEM library creation software. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

MOTIVATION: Clustering is commonly used to identify the best decoy among many generated in protein structure prediction when using energy alone is insufficient. Calculation of the pairwise distance matrix for a large decoy set is computationally expensive. Typically, only a reduced set of decoys using energy filtering is subjected to clustering analysis. A fast clustering method for a large decoy set would be beneficial to protein structure prediction and this still poses a challenge. RESULTS: We propose a method using propagation of geometric constraints to accelerate exact clustering, without compromising the distance measure. Our method can be used with any metric distance. Metrics that are expensive to compute and have known cheap lower and upper bounds will benefit most from the method. We compared our method's accuracy against published results from the SPICKER clustering software on 40 large decoy sets from the I-TASSER protein folding engine. We also performed some additional speed comparisons on six targets from the 'semfold' decoy set. In our tests, our method chose a better decoy than the energy criterion in 25 out of 40 cases versus 20 for SPICKER. Our method also was shown to be consistently faster than another fast software performing exact clustering named Calibur. In some cases, our approach can even outperform the speed of an approximate method. AVAILABILITY: Our C++ software is released under the GNU General Public License. It can be downloaded from http://www.riken.jp/zhangiru/software/durandal_released.tgz.

UNLABELLED: Bioinformaticians are tackling increasingly computation-intensive tasks. In the meantime, workstations are shifting towards multi-core architectures and even massively multi-core may be the norm soon. Bag-of-Tasks (BoT) applications are commonly encountered in bioinformatics. They consist of a large number of independent computation-intensive tasks. This note introduces PAR, a scalable, dynamic, parallel and distributed execution engine for Bag-of-Tasks. PAR is aimed at multi-core architectures and small clusters. Accelerations obtained thanks to PAR on two different applications are shown. AVAILABILITY: PAR is released under the GNU General Public License version three and can be freely downloaded (http://download.savannah.gnu.org/releases/par/par.tgz).