Estimation of membrane proteins in the human proteome

Genomics and proteomics have added valuable information to our knowledgebase of the human biological system including the discovery of therapeutic targets and disease biomarkers. However, molecular profiling studies commonly result in the identification of novel proteins of unknown localization. A class of proteins of special interest is membrane proteins, in particular plasma membrane proteins. Despite their biological and medical significance, the 3-dimensional structures of less than 1% of plasma membrane proteins have been determined. In order to aid in identification of membrane proteins, a number of computational methods have been developed. These tools operate by predicting the presence of transmembrane segments. Here, we utilized five topology prediction methods (TMHMM, SOSUI, waveTM, HMMTOP, and TopPred II) in order to estimate the ratio of integral membrane proteins in the human proteome. These methods employ different algorithms and include a newly-developed method (waveTM) that has yet to be tested on a large proteome database. Since these tools are prone for error mainly as a result of falsely predicting signal peptides as transmembrane segments, we have utilized an additional method, SignalP. Based on our analyses, the ratio of human proteins with transmembrane segments is estimated to fall between 15% and 39% with a consensus of 13%. Agreement among the programs is reduced further when both a positive identification of a membrane protein and the number of transmembrane segments per protein are considered. Such a broad range of prediction depends on the selectivity of the individual method in predicting integral membrane proteins. These methods can play a critical role in determining protein structure and, hence, identifying suitable drug targets in humans.     

CoPreTHi: a Web tool which combines transmembrane protein segment prediction methods

CoPreTHi is a Java based web application, which combines the results of methods that predict the location of transmembrane segments in protein sequences into a joint prediction histogram. Clearly, the joint prediction algorithm, produces superior quality results than individual prediction schemes. The program is available at http://o2.db.uoa.gr/CoPreTHi.     

TMpro web server and web service: transmembrane helix prediction through amino acid property analysis

TMpro is a transmembrane (TM) helix prediction algorithm that uses language processing methodology for TM segment identification. It is primarily based on the analysis of statistical distributions of properties of amino acids in transmembrane segments. This article describes the availability of TMpro on the internet via a web interface. The key features of the interface are: (i) output is generated in multiple formats including a user-interactive graphical chart which allows comparison of TMpro predicted segment locations with other labeled segments input by the user, such as predictions from other methods. (ii) Up to 5000 sequences can be submitted at a time for prediction. (iii) TMpro is available as a web server and is published as a web service so that the method can be accessed by users as well as other services depending on the need for data integration. Availability: http://linzer.blm.cs.cmu.edu/tmpro/ (web server and help), http://blm.sis.pitt.edu:8080/axis/services/TMProFetcherService (web service).     

PPO: predictor for prokaryotic operons

SUMMARY: We present an operon predictor for prokaryotic operons (PPO), which can predict operons in the entire prokaryotic genome. The prediction algorithm used in PPO allows the user to select binary particle swarm optimization (BPSO), a genetic algorithm (GA) or some other methods introduced in the literature to predict operons. The operon predictor on our web server and the provided database are easy to access and use. The main features offered are: (i) selection of the prediction algorithm; (ii) adjustable parameter settings of the prediction algorithm; (iii) graphic visualization of results; (iv) integrated database queries; (v) listing of experimentally verified operons; and (vi) related tools. Availability and implementation: PPO is freely available at http://bio.kuas.edu.tw/PPO/.     

BTEVAL: a server for evaluation of beta-turn prediction methods

This paper describes a web server BTEVAL, developed for assessing the performance of newly developed beta-turn prediction method and it's ranking with respect to other existing beta-turn prediction methods. Evaluation of a method can be carried out on a single protein or a number of proteins. It consists of clean data set of 426 non-homologous proteins with seven subsets of these proteins. Users can evaluate their method on any subset or a complete set of data. The method is assessed at amino acid level and performance is evaluated in terms of Qtotal, Qpredicted, Qobserved and MCC measures. The server also compares the performance of the method with other existing beta-turn prediction methods such as Chou-Fasman algorithm, Thornton's algorithm, GORBTURN, 1-4 and 2-3 Correlation model, Sequence coupled model and BTPRED. The server is accessible from http://imtech.res.in/raghava/bteval/     

Prediction of PK-specific phosphorylation site based on information entropy

Phosphorylation is a crucial way to control the activity of proteins in many eukaryotic organisms in vivo. Experimental methods to determine phosphorylation sites in substrates are usually restricted by the in vitro condition of enzymes and very intensive in time and labor. Although some in silico methods and web servers have been introduced for automatic detection of phosphorylation sites, sophisticated methods are still in urgent demand to further improve prediction performances. Protein primary sequences can help predict phosphorylation sites catalyzed by different protein kinase and most computational approaches use a short local peptide to make prediction. However, the useful information may be lost if only the conservative residues that are not close to the phosphorylation site are considered in prediction, which would hamper the prediction results. A novel prediction method named IEPP (Information-Entropy based Phosphorylation Prediction) is presented in this paper for automatic detection of potential phosphorylation sites. In prediction, the sites around the phosphorylation sites are selected or excluded by their entropy values. The algorithm was compared with other methods such as GSP and PPSP on the ABL, MAPK and PKA PK families. The superior prediction accuracies were obtained in various measurements such as sensitivity (Sn) and specificity (Sp). Furthermore, compared with some online prediction web servers on the new discovered phosphorylation sites, IEPP also yielded the best performance. IEPP is another useful computational resource for identification of PK-specific phosphorylation sites and it also has the advantages of simpleness, efficiency and convenience.     

Prediction of PK-specific phosphorylation site based on information entropy

Phosphorylation is a crucial way to control the activity of proteins in many eukaryotic organisms in vivo. Experimental methods to determine phosphorylation sites in substrates are usually restricted by the in vitro condition of enzymes and very intensive in time and labor. Although some in silico methods and web servers have been introduced for automatic detection of phosphorylation sites, sophisticated methods are still in urgent demand to further improve prediction performances. Protein primary se-quences can help predict phosphorylation sites catalyzed by different protein kinase and most com-putational approaches use a short local peptide to make prediction. However, the useful information may be lost if only the conservative residues that are not close to the phosphorylation site are consid-ered in prediction, which would hamper the prediction results. A novel prediction method named IEPP (Information-Entropy based Phosphorylation Prediction) is presented in this paper for automatic de-tection of potential phosphorylation sites. In prediction, the sites around the phosphorylation sites are selected or excluded by their entropy values. The algorithm was compared with other methods such as GSP and PPSP on the ABL, MAPK and PKA PK families. The superior prediction accuracies were ob-tained in various measurements such as sensitivity (Sn) and specificity (Sp). Furthermore, compared with some online prediction web servers on the new discovered phosphorylation sites, IEPP also yielded the best performance. IEPP is another useful computational resource for identification of PK-specific phosphorylation sites and it also has the advantages of simpleness, efficiency and con-venience.     

GOR V server for protein secondary structure prediction

SUMMARY: We have created the GOR V web server for protein secondary structure prediction. The GOR V algorithm combines information theory, Bayesian statistics and evolutionary information. In its fifth version, the GOR method reached (with the full jack-knife procedure) an accuracy of prediction Q3 of 73.5%. Although GOR V has been among the most successful methods, its online unavailability has been a deterrent to its popularity. Here, we remedy this situation by creating the GOR V server.     

FoldIndex: a simple tool to predict whether a given protein sequence is intrinsically unfolded

An easy-to-use, versatile and freely available graphic web server, FoldIndex is described: it predicts if a given protein sequence is intrinsically unfolded implementing the algorithm of Uversky and co-workers, which is based on the average residue hydrophobicity and net charge of the sequence. FoldIndex has an error rate comparable to that of more sophisticated fold prediction methods. Sliding windows permit identification of large regions within a protein that possess folding propensities different from those of the whole protein.     

InterProSurf: a web server for predicting interacting sites on protein surfaces

A new web server, InterProSurf, predicts interacting amino acid residues in proteins that are most likely to interact with other proteins, given the 3D structures of subunits of a protein complex. The prediction method is based on solvent accessible surface area of residues in the isolated subunits, a propensity scale for interface residues and a clustering algorithm to identify surface regions with residues of high interface propensities. Here we illustrate the application of InterProSurf to determine which areas of Bacillus anthracis toxins and measles virus hemagglutinin protein interact with their respective cell surface receptors. The computationally predicted regions overlap with those regions previously identified as interface regions by sequence analysis and mutagenesis experiments. AVAILABILITY: The InterProSurf web server is available at http://curie.utmb.edu/     

A method for prediction of conserved RNA secondary structures

The RNA secondary structure prediction is a classical problem in bioinformatics. The most efficient approach to this problem is based on the idea of a comparative analysis. In this approach the algorithms utilize multiple alignment of the RNA sequences and find common RNA structure. This paper describes a new algorithm for this task. This algorithm does not require predefined multiple alignment. The main idea of the algorithm is based on MEME-like iterative searching of abstract profile on different levels. On the first level the algorithm searches the common blocks in the RNA sequences and creates chain of this blocks. On the next step the algorithm refines the chain of common blocks. On the last stage the algorithm searches sets of common helices that have consistent locations relative to common blocks. The algorithm was tested on sets of tRNA with a subset of junk sequences and on RFN riboswitches. The algorithm is implemented as a web server (http://bioinf.fbb.msu.ru/RNAAlign/).     

Pfold: RNA secondary structure prediction using stochastic context-free grammars

RNA secondary structures are important in many biological processes and efficient structure prediction can give vital directions for experimental investigations. Many available programs for RNA secondary structure prediction only use a single sequence at a time. This may be sufficient in some applications, but often it is possible to obtain related RNA sequences with conserved secondary structure. These should be included in structural analyses to give improved results. This work presents a practical way of predicting RNA secondary structure that is especially useful when related sequences can be obtained. The method improves a previous algorithm based on an explicit evolutionary model and a probabilistic model of structures. Predictions can be done on a web server at http://www.daimi.au.dk/~compbio/pfold.     

EVA: continuous automatic evaluation of protein structure prediction servers.

Evaluation of protein structure prediction methods is difficult and time-consuming. Here, we describe EVA, a web server for assessing protein structure prediction methods, in an automated, continuous and large-scale fashion. Currently, EVA evaluates the performance of a variety of prediction methods available through the internet. Every week, the sequences of the latest experimentally determined protein structures are sent to prediction servers, results are collected, performance is evaluated, and a summary is published on the web. EVA has so far collected data for more than 3000 protein chains. These results may provide valuable insight to both developers and users of prediction methods. AVAILABILITY: http://cubic.bioc.columbia.edu/eva. CONTACT: eva@cubic.bioc.columbia.edu     

Performance of human and server prediction in CAPRI rounds 38-45

CAPRI challenges offer a variety of blind tests for protein-protein interaction prediction. In CAPRI Rounds 38-45, we generated a set of putative binding modes for each target with an FFT-based docking algorithm, and then scored and ranked these binding modes with a proprietary scoring function, ITScorePP. We have also developed a novel web server, Rebipp. The algorithm utilizes information retrieval to identify relevant biological information to significantly reduce the search space for a particular protein. In parallel, we have also constructed a GPU-based docking server, MDockPP, for protein-protein complex structure prediction. Here, the performance of our protocol in CAPRI rounds 38-45 is reported, which include 16 docking and scoring targets. Among them, three targets contain multiple interfaces: Targets 124, 125, and 136 have 2, 4, and 3 interfaces, respectively. In the predictor experiments, we predicted correct binding modes for nine targets, including one high-accuracy interface, six medium-accuracy binding modes, and six acceptable-accuracy binding modes. For the docking server prediction experiments, we predicted correct binding modes for eight targets, including one high-accuracy, three medium-accuracy, and five acceptable-accuracy binding modes.     

A modular concept of HLA for comprehensive peptide binding prediction

A variety of algorithms have been successful in predicting human leukocyte antigen (HLA)-peptide binding for HLA variants for which plentiful experimental binding data exist. Although predicting binding for only the most common HLA variants may provide sufficient population coverage for vaccine design, successful prediction for as many HLA variants as possible is necessary to understand the immune response in transplantation and immunotherapy. However, the high cost of obtaining peptide binding data limits the acquisition of binding data. Therefore, a prediction algorithm, which applies the binding information from well-studied HLA variants to HLA variants, for which no peptide data exist, is necessary. To this end, a modular concept of class I HLA-peptide binding prediction was developed. Accurate predictions were made for several alleles without using experimental peptide binding data specific to those alleles. We include a comparison of module-based prediction and supertype-based prediction. The modular concept increased the number of predictable alleles from 15 to 75 of HLA-A and 12 to 36 of HLA-B proteins. Under the modular concept, binding data of certain HLA alleles can make prediction possible for numerous additional alleles. We report here a ranking of HLA alleles, which have been identified to be the most informative. Modular peptide binding prediction is freely available to researchers on the web at http://www.peptidecheck.org .     

Prophinder: a computational tool for prophage prediction in prokaryotic genomes

Prophinder is a prophage prediction tool coupled with a prediction database, a web server and web service. Predicted prophages will help to fill the gaps in the current sparse phage sequence space, which should cover an estimated 100 million species. Systematic and reliable predictions will enable further studies of prophages contribution to the bacteriophage gene pool and to better understand gene shuffling between prophages and phages infecting the same host. AVAILABILITY: Softare is available at http://aclame.ulb.ac.be/prophinder     

EVA: Evaluation of protein structure prediction servers

EVA (http://cubic.bioc.columbia.edu/eva/) is a web server for evaluation of the accuracy of automated protein structure prediction methods. The evaluation is updated automatically each week, to cope with the large number of existing prediction servers and the constant changes in the prediction methods. EVA currently assesses servers for secondary structure prediction, contact prediction, comparative protein structure modelling and threading/fold recognition. Every day, sequences of newly available protein structures in the Protein Data Bank (PDB) are sent to the servers and their predictions are collected. The predictions are then compared to the experimental structures once a week; the results are published on the EVA web pages. Over time, EVA has accumulated prediction results for a large number of proteins, ranging from hundreds to thousands, depending on the prediction method. This large sample assures that methods are compared reliably. As a result, EVA provides useful information to developers as well as users of prediction methods.     

XtalPred: a web server for prediction of protein crystallizability

XtalPred is a web server for prediction of protein crystallizability. The prediction is made by comparing several features of the protein with distributions of these features in TargetDB and combining the results into an overall probability of crystallization. XtalPred provides: (1) a detailed comparison of the protein's features to the corresponding distribution from TargetDB; (2) a summary of protein features and predictions that indicate problems that are likely to be encountered during protein crystallization; (3) prediction of ligands; and (4) (optional) lists of close homologs from complete microbial genomes that are more likely to crystallize. AVAILABILITY: The XtalPred web server is freely available for academic users on http://ffas.burnham.org/XtalPred