CAPRI rounds 3-5 reveal promising successes and future challenges for RosettaDock

CAPRI Rounds 3, 4, and 5 are the first public test of the published RosettaDock algorithm. The targets cover a wide range of sizes and shapes. For most targets, published biological information indicated the region of the binding site on at least one docking partner. The RosettaDock algorithm produced high accuracy predictions for three targets, medium-accuracy predictions for two targets, and an acceptable prediction for one target. RosettaDock predicted all five targets with less than 450 residues to high or medium accuracy, but it predicted only one of seven targets with above 450 residues to acceptable accuracy. RosettaDock's high-accuracy predictions for small to moderately large targets reveal the predictive power and fidelity of the algorithm, especially the high-resolution refinement and scoring protocol. In addition, RosettaDock can predict complexes from at least one homology-modeled docking partner with comparable accuracy to unbound cases of similar size. Larger targets present a more intensive sampling problem, and some large targets present repulsive barriers to entering the binding site. Ongoing improvements to RosettaDock's low-resolution search may alleviate this problem. This first public test suggests that RosettaDock can be useful in a significant range of applications in biochemistry and cell biology.     

Bioinformatic requirements for protein database searching using predicted epitopes from disease-associated antibodies

We describe a new approach to identify proteins involved in disease pathogenesis. The technology, Epitope-Mediated Antigen Prediction (E-MAP), leverages the specificity of patients' immune responses to disease-relevant targets and requires no prior knowledge about the protein. E-MAP links pathologic antibodies of unknown specificity, isolated from patient sera, to their cognate antigens in the protein database. The E-MAP process first involves reconstruction of a predicted epitope using a peptide combinatorial library. We then search the protein database for closely matching amino acid sequences. Previously published attempts to identify unknown antibody targets in this manner have largely been unsuccessful for two reasons: 1) short predicted epitopes yield too many irrelevant matches from a database search and 2) the epitopes may not accurately represent the native antigen with sufficient fidelity. Using an in silico model, we demonstrate the critical threshold requirements for epitope length and epitope fidelity. We find that epitopes generally need to have at least seven amino acids, with an overall accuracy of >70% to the native protein, in order to correctly identify the protein in a nonredundant protein database search. We then confirmed these findings experimentally, using the predicted epitopes for four monoclonal antibodies. Since many predicted epitopes often fail to achieve the seven amino acid threshold, we demonstrate the efficacy of paired epitope searches. This is the first systematic analysis of the computational framework to make this approach viable, coupled with experimental validation.     

Modelling eye movements in a categorical search task

We introduce a model of eye movements during categorical search, the task of finding and recognizing categorically defined targets. It extends a previous model of eye movements during search (target acquisition model, TAM) by using distances from an support vector machine classification boundary to create probability maps indicating pixel-by-pixel evidence for the target category in search images. Other additions include functionality enabling target-absent searches, and a fixation-based blurring of the search images now based on a mapping between visual and collicular space. We tested this model on images from a previously conducted variable set-size (6/13/20) present/absent search experiment where participants searched for categorically defined teddy bear targets among random category distractors. The model not only captured target-present/absent set-size effects, but also accurately predicted for all conditions the numbers of fixations made prior to search judgements. It also predicted the percentages of first eye movements during search landing on targets, a conservative measure of search guidance. Effects of set size on false negative and false positive errors were also captured, but error rates in general were overestimated. We conclude that visual features discriminating a target category from non-targets can be learned and used to guide eye movements during categorical search.     

Detection of potential enzyme targets by metabolic modelling and optimization: application to a simple enzymopathy

MOTIVATION: A very promising approach in drug discovery involves the integration of available biomedical data through mathematical modelling and data mining. We have developed a method called optimization program for drug discovery (OPDD) that allows new enzyme targets to be identified in enzymopathies through the integration of metabolic models and biomedical data in a mathematical optimization program. The method involves four steps: (i) collection of the necessary information about the metabolic system and disease; (ii) translation of the information into mathematical terms; (iii) computation of the optimization programs prioritizing the solutions that propose the inhibition of a reduced number of enzymes and (iv) application of additional biomedical criteria to select and classify the solutions. Each solution consists of a set of predicted values for metabolites, initial substrates and enzyme activities, which describe a biologically acceptable steady state of the system that shifts the pathologic state towards a healthy state. RESULTS: The OPDD was used to detect target enzymes in an enzymopathy, the human hyperuricemia. An existing S-system model and bibliographic information about the disease were used. The method detected six single-target enzyme solutions involving dietary modification, one of them coinciding with the conventional clinical treatment using allopurinol. The OPDD detected a large number of possible solutions involving two enzyme targets. All except one contained one of the previously detected six enzyme targets. The purpose of this work was not to obtain solutions for direct clinical implementation but to illustrate how increasing levels of biomedical information can be integrated together with mathematical models in drug discovery. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.     

Enhancing peptide identification confidence by combining search methods

Confident peptide identification is one of the most important components in mass-spectrometry-based proteomics. We propose a method to properly combine the results from different database search methods to enhance the accuracy of peptide identifications. The database search methods included in our analysis are SEQUEST (v27 rev12), ProbID (v1.0), InsPecT (v20060505), Mascot (v2.1), X! Tandem (v2007.07.01.2), OMSSA (v2.0) and RAId_DbS. Using two data sets, one collected in profile mode and one collected in centroid mode, we tested the search performance of all 21 combinations of two search methods as well as all 35 possible combinations of three search methods. The results obtained from our study suggest that properly combining search methods does improve retrieval accuracy. In addition to performance results, we also describe the theoretical framework which in principle allows one to combine many independent scoring methods including de novo sequencing and spectral library searches. The correlations among different methods are also investigated in terms of common true positives, common false positives, and a global analysis. We find that the average correlation strength, between any pairwise combination of the seven methods studied, is usually smaller than the associated standard error. This indicates only weak correlation may be present among different methods and validates our approach in combining the search results. The usefulness of our approach is further confirmed by showing that the average cumulative number of false positive peptides agrees reasonably well with the combined E-value. The data related to this study are freely available upon request.     

N-(3,5-Dichloro-4-(2,4,6-trichlorophenoxy)phenyl)benzenesulfonamide: A new dual-target inhibitor of mitochondrial complex II and complex III via structural simplification

Mitochondrial complex II and complex III are two promising targets for the development of numerous pharmaceuticals and pesticides. Although tremendous inhibitors of either complex II or complex III were identified, compounds which are capable of prohibiting the activities of both complexes have been rarely reported. Since multi-target drugs can interact with several drug targets simultaneously, we were keen on discovering new and potent dual-target inhibitors of both complex II and complex III. Therefore, a new series of structurally simplified sulfonamides bearing a diaryl ether scaffold were designed and synthesized in this paper. Afterwards, the biological activities of the newly synthesized compounds were evaluated. The results implied that several compounds demonstrated outstanding potency against succinate-cytochrome c reductase (SCR, a mixture of complex II and complex III). Further studies confirmed that N-(3,5-Dichloro-4-(2,4,6-trichlorophenoxy)phenyl)benzenesulfonamide (3f), a representative compound herein, was identified as a dual-target inhibitor of both complexes. Furthermore, computational simulations were also performed to have a better understanding about binding of 3f to the enzyme complexes, which concluded that 3f should bind to complex II and the Q_o site of complex III. Consequently, we harbor the idea that this work can be beneficial for the synthesis and discovery of more dual- or multi-target inhibitors.     

Estimating quality of template-based protein models by alignment stability

The error in protein tertiary structure prediction is unavoidable, but it is not explicitly shown in most of the current prediction algorithms. Estimated error of a predicted structure is crucial information for experimental biologists to use the prediction model for design and interpretation of experiments. Here, we propose a method to estimate errors in predicted structures based on the stability of the optimal target-template alignment when compared with a set of suboptimal alignments. The stability of the optimal alignment is quantified by an index named the SuboPtimal Alignment Diversity (SPAD). We implemented SPAD in a profile-based threading algorithm and investigated how well SPAD can indicate errors in threading models using a large benchmark dataset of 5232 alignments. SPAD shows a very good correlation not only to alignment shift errors but also structure-level errors, the root mean square deviation (RMSD) of predicted structure models to the native structures (i.e. global errors), and local errors at each residue position. We have further compared SPAD with seven other quality measures, six from sequence alignment-based measures and one atomic statistical potential, discrete optimized protein energy (DOPE), in terms of the correlation coefficient to the global and local structure-level errors. In terms of the correlation to the RMSD of structure models, when a target and a template are in the same SCOP family, the sequence identity showed a best correlation to the RMSD; in the superfamily level, SPAD was the best; and in the fold level, DOPE was best. However, in a head-to-head comparison, SPAD wins over the other measures. Next, SPAD is compared with three other measures of local errors. In this comparison, SPAD was best in all of the family, the superfamily and the fold levels. Using the discovered correlation, we have also predicted the global and local error of our predicted structures of CASP7 targets by the SPAD. Finally, we proposed a sausage representation of predicted tertiary structures which intuitively indicate the predicted structure and the estimated error range of the structure simultaneously.     

Therapeutic strategies of dual-target small molecules to overcome drug resistance in cancer therapy

Despite some advances in targeted therapeutics of human cancers, curative cancer treatment still remains a tremendous challenge due to the occurrence of drug resistance. A variety of underlying resistance mechanisms to targeted cancer drugs have recently revealed that the dual-target therapeutic strategy would be an attractive avenue. Compared to drug combination strategies, one agent simultaneously modulating two druggable targets generally shows fewer adverse reactions and lower toxicity. As a consequence, the dual-target small molecule has been extensively explored to overcome drug resistance in cancer therapy. Thus, in this review, we focus on summarizing drug resistance mechanisms of cancer cells, such as enhanced drug efflux, deregulated cell death, DNA damage repair, and epigenetic alterations. Based upon the resistance mechanisms, we further discuss the current therapeutic strategies of dual-target small molecules to overcome drug resistance, which will shed new light on exploiting more intricate mechanisms and relevant dual-target drugs for future cancer therapeutics.     

The Protein Model Portal

Structural Genomics has been successful in determining the structures of many unique proteins in a high throughput manner. Still, the number of known protein sequences is much larger than the number of experimentally solved protein structures. Homology (or comparative) modeling methods make use of experimental protein structures to build models for evolutionary related proteins. Thereby, experimental structure determination efforts and homology modeling complement each other in the exploration of the protein structure space. One of the challenges in using model information effectively has been to access all models available for a specific protein in heterogeneous formats at different sites using various incompatible accession code systems. Often, structure models for hundreds of proteins can be derived from a given experimentally determined structure, using a variety of established methods. This has been done by all of the PSI centers, and by various independent modeling groups. The goal of the Protein Model Portal (PMP) is to provide a single portal which gives access to the various models that can be leveraged from PSI targets and other experimental protein structures. A single interface allows all existing pre-computed models across these various sites to be queried simultaneously, and provides links to interactive services for template selection, target-template alignment, model building, and quality assessment. The current release of the portal consists of 7.6 million model structures provided by different partner resources (CSMP, JCSG, MCSG, NESG, NYSGXRC, JCMM, ModBase, SWISS-MODEL Repository). The PMP is available at and from the PSI Structural Genomics Knowledgebase.     

Colorimetric Aptasensor Using Unmodified Gold Nanoparticles for Homogeneous Multiplex Detection

Colorimetric aptasensors using unmodified gold nanoparticles (AuNPs) have attracted much attention because of their low cost, simplicity, and practicality, and they have been developed for various targets in the past several years. However, previous research has focused on developing single-target assays. Here, we report the development of a homogeneous multiplex aptasensor by using more than one class of aptamers to stabilize AuNPs. Using sulfadimethoxine (SDM), kanamycin (KAN) and adenosine (ADE) as example targets, a KAN aptamer (750 nM), an SDM aptamer (250 nM) and an ADE aptamer (500 nM) were mixed at a 1∶1∶1 volume ratio and adsorbed directly onto the surface of unmodified AuNPs by electrostatic interaction. Upon the addition of any of the three targets, the conformation of the corresponding aptamer changed from a random coil structure to a rigid folded structure, which could not adsorb and stabilize AuNPs. The AuNPs aggregated in a specific reaction buffer (20 mM Tris-HCl containing 20 mM NaCl and 5 mM KCl), which led to a color change from red to purple/blue. These results demonstrate that the multiplex colorimetric aptasensor detected three targets simultaneously while maintaining the same sensitivity as a single-target aptasensor for each individual target. The multiplex aptasensor could be extended to other aptamers for various molecular detection events. Due to its simple design, easy operation, fast response, cost effectiveness and lack of need for sophisticated instrumentation, the proposed strategy provides a powerful tool to examine large numbers of samples to screen for a small number of potentially positive samples containing more than one analyte, which can be further validated using sophisticated instruments.     

ESyPred3D: Prediction of proteins 3D structures

MOTIVATION: Homology or comparative modeling is currently the most accurate method to predict the three-dimensional structure of proteins. It generally consists in four steps: (1) databanks searching to identify the structural homolog, (2) target-template alignment, (3) model building and optimization, and (4) model evaluation. The target-template alignment step is generally accepted as the most critical step in homology modeling. RESULTS: We present here ESyPred3D, a new automated homology modeling program. The method gets benefit of the increased alignment performances of a new alignment strategy. Alignments are obtained by combining, weighting and screening the results of several multiple alignment programs. The final three-dimensional structure is build using the modeling package MODELLER. ESyPred3D was tested on 13 targets in the CASP4 experiment (Critical Assessment of Techniques for Proteins Structural Prediction). Our alignment strategy obtains better results compared to PSI-BLAST alignments and ESyPred3D alignments are among the most accurate compared to those of participants having used the same template. AVAILABILITY: ESyPred3D is available through its web site at http://www.fundp.ac.be/urbm/bioinfo/esypred/ CONTACT: christophe.lambert@fundp.ac.be; http://www.fundp.ac.be/~lambertc     

Systematic analysis of the effect of multiple templates on the accuracy of comparative models of protein structure

Background  

Although multiple templates are frequently used in comparative modeling, the effect of inclusion of additional template(s) on model accuracy (when compared to that of corresponding single-template based models) is not clear. To address this, we systematically analyze two-template models, the simplest case of multiple-template modeling. For an existing target-template pair (single-template modeling), a two-template based model of the target sequence is constructed by including an additional template without changing the original alignment to measure the effect of the second template on model accuracy.     

iGibbs: improving Gibbs motif sampler for proteins by sequence clustering and iterative pattern sampling

The motif prediction problem is to predict short, conserved subsequences that are part of a family of sequences, and it is a very important biological problem. Gibbs is one of the first successful motif algorithms and it runs very fast compared with other algorithms, and its search behavior is based on the well-studied Gibbs random sampling. However, motif prediction is a very difficult problem and Gibbs may not predict true motifs in some cases. Thus, the authors explored a possibility of improving the prediction accuracy of Gibbs while retaining its fast runtime performance. In this paper, the authors considered Gibbs only for proteins, not for DNA binding sites. The authors have developed iGibbs, an integrated motif search framework for proteins that employs two previous techniques of their own: one for guiding motif search by clustering sequences and another by pattern refinement. These two techniques are combined to a new double clustering approach to guiding motif search. The unique feature of their framework is that users do not have to specify the number of motifs to be predicted when motifs occur in different subsets of the input sequences since it automatically clusters input sequences into clusters and predict motifs from the clusters. Tests on the PROSITE database show that their framework improved the prediction accuracy of Gibbs significantly. Compared with more exhaustive search methods like MEME, iGibbs predicted motifs more accurately and runs one order of magnitude faster.     

MassMatrix: A database search program for rapid characterization of proteins and peptides from tandem mass spectrometry data

MassMatrix is a program that matches tandem mass spectra with theoretical peptide sequences derived from a protein database. The program uses a mass accuracy sensitive probabilistic score model to rank peptide matches. The MS/MS search software was evaluated by use of a high mass accuracy dataset and its results compared with those from MASCOT, SEQUEST, X!Tandem, and OMSSA. For the high mass accuracy data, MassMatrix provided better sensitivity than MASCOT, SEQUEST, X!Tandem, and OMSSA for a given specificity and the percentage of false positives was 2%. More importantly all manually validated true positives corresponded to a unique peptide/spectrum match. The presence of decoy sequence and additional variable PTMs did not significantly affect the results from the high mass accuracy search. MassMatrix performs well when compared with MASCOT, SEQUEST, X!Tandem, and OMSSA with regard to search time. MassMatrix was also run on a distributed memory clusters and achieved search speeds of ～100 000 spectra per hour when searching against a complete human database with eight variable modifications. The algorithm is available for public searches at http://www.massmatrix.net.     

Hierarchical virtual screening of the dual MMP-2/HDAC-6 inhibitors from natural products based on pharmacophore models and molecular docking

The dual-target inhibitors tend to improve the response rate in treating tumors, comparing with the single-target inhibitors. Matrix metalloproteinase-2 (MMP-2) and histone deacetylase-6 (HDAC-6) are attractive targets for cancer therapy. In this study, the hierarchical virtual screening of dual MMP-2/HDAC-6 inhibitors from natural products is investigated. The pharmacophore model of MMP-2 inhibitors is built based on ligands, but the pharmacophore model of HDAC-6 inhibitors is built based on the experimental crystal structures of multiple receptor–ligand complexes. The reliability of these two pharmacophore models is validated subsequently. The hierarchical virtual screening, combining these two different pharmacophore models of MMP-2 and HDAC-6 inhibitors with molecular docking, is carried out to identify the dual MMP-2/HDAC-6 inhibitors from a database of natural products. The four potential dual MMP-2/HDAC-6 inhibitors of natural products, STOCK1 N-46177, STOCK1 N-52245, STOCK1 N-55477, and STOCK1 N-69706, are found. The studies of binding modes show that the screened four natural products can simultaneously well bind with the MMP-2 and HDAC-6 active sites by different kinds of interactions, to inhibit the MMP-2 and HDAC-6 activities. In addition, the ADMET properties of screened four natural products are assessed. These found dual MMP-2/HDAC-6 inhibitors of natural products could serve as the lead compounds for designing the new dual MMP-2/HDAC-6 inhibitors having higher biological activities by carrying out structural modifications and optimizations in the future studies.     

Modeling protein-protein,protein-peptide,and protein-oligosaccharide complexes: CAPRI 7th edition

We present the seventh report on the performance of methods for predicting the atomic resolution structures of protein complexes offered as targets to the community-wide initiative on the Critical Assessment of Predicted Interactions. Performance was evaluated on the basis of 36 114 models of protein complexes submitted by 57 groups—including 13 automatic servers—in prediction rounds held during the years 2016 to 2019 for eight protein-protein, three protein-peptide, and five protein-oligosaccharide targets with different length ligands. Six of the protein-protein targets represented challenging hetero-complexes, due to factors such as availability of distantly related templates for the individual subunits, or for the full complex, inter-domain flexibility, conformational adjustments at the binding region, or the multi-component nature of the complex. The main challenge for the protein-peptide and protein-oligosaccharide complexes was to accurately model the ligand conformation and its interactions at the interface. Encouragingly, models of acceptable quality, or better, were obtained for a total of six protein-protein complexes, which included four of the challenging hetero-complexes and a homo-decamer. But fewer of these targets were predicted with medium or higher accuracy. High accuracy models were obtained for two of the three protein-peptide targets, and for one of the protein-oligosaccharide targets. The remaining protein-sugar targets were predicted with medium accuracy. Our analysis indicates that progress in predicting increasingly challenging and diverse types of targets is due to closer integration of template-based modeling techniques with docking, scoring, and model refinement procedures, and to significant incremental improvements in the underlying methodologies.     

Improved scoring function for comparative modeling using the M4T method

Improvements in comparative protein structure modeling for the remote target-template sequence similarity cases are possible through the optimal combination of multiple template structures and by improving the quality of target-template alignment. Recently developed MMM and M4T methods were designed to address these problems. Here we describe new developments in both the alignment generation and the template selection parts of the modeling algorithms. We set up a new scoring function in MMM to deliver more accurate target-template alignments. This was achieved by developing and incorporating into the composite scoring function a novel statistical pairwise potential that combines local and non-local terms. The non-local term of the statistical potential utilizes a shuffled reference state definition that helped to eliminate most of the false positive signal from the background distribution of pairwise contacts. The accuracy of the scoring function was further increased by using BLOSUM mutation table scores.     

Using Noun Phrases for Navigating Biomedical Literature on Pubmed: How Many Updates Are We Losing Track of?

Author-supplied citations are a fraction of the related literature for a paper. The "related citations" on PubMed is typically dozens or hundreds of results long, and does not offer hints why these results are related. Using noun phrases derived from the sentences of the paper, we show it is possible to more transparently navigate to PubMed updates through search terms that can associate a paper with its citations. The algorithm to generate these search terms involved automatically extracting noun phrases from the paper using natural language processing tools, and ranking them by the number of occurrences in the paper compared to the number of occurrences on the web. We define search queries having at least one instance of overlap between the author-supplied citations of the paper and the top 20 search results as citation validated (CV). When the overlapping citations were written by same authors as the paper itself, we define it as CV-S and different authors is defined as CV-D. For a systematic sample of 883 papers on PubMed Central, at least one of the search terms for 86% of the papers is CV-D versus 65% for the top 20 PubMed "related citations." We hypothesize these quantities computed for the 20 million papers on PubMed to differ within 5% of these percentages. Averaged across all 883 papers, 5 search terms are CV-D, and 10 search terms are CV-S, and 6 unique citations validate these searches. Potentially related literature uncovered by citation-validated searches (either CV-S or CV-D) are on the order of ten per paper--many more if the remaining searches that are not citation-validated are taken into account. The significance and relationship of each search result to the paper can only be vetted and explained by a researcher with knowledge of or interest in that paper.     

A composite score for predicting errors in protein structure models

Reliable prediction of model accuracy is an important unsolved problem in protein structure modeling. To address this problem, we studied 24 individual assessment scores, including physics-based energy functions, statistical potentials, and machine learning-based scoring functions. Individual scores were also used to construct approximately 85,000 composite scoring functions using support vector machine (SVM) regression. The scores were tested for their abilities to identify the most native-like models from a set of 6000 comparative models of 20 representative protein structures. Each of the 20 targets was modeled using a template of <30% sequence identity, corresponding to challenging comparative modeling cases. The best SVM score outperformed all individual scores by decreasing the average RMSD difference between the model identified as the best of the set and the model with the lowest RMSD (DeltaRMSD) from 0.63 A to 0.45 A, while having a higher Pearson correlation coefficient to RMSD (r=0.87) than any other tested score. The most accurate score is based on a combination of the DOPE non-hydrogen atom statistical potential; surface, contact, and combined statistical potentials from MODPIPE; and two PSIPRED/DSSP scores. It was implemented in the SVMod program, which can now be applied to select the final model in various modeling problems, including fold assignment, target-template alignment, and loop modeling.