PoSSuM: a database of similar protein–ligand binding and putative pockets

Numerous potential ligand-binding sites are available today, along with hundreds of thousands of known binding sites observed in the PDB. Exhaustive similarity search for such vastly numerous binding site pairs is useful to predict protein functions and to enable rapid screening of target proteins for drug design. Existing databases of ligand-binding sites offer databases of limited scale. For example, SitesBase covers only ∼33 000 known binding sites. Inferring protein function and drug discovery purposes, however, demands a much more comprehensive database including known and putative-binding sites. Using a novel algorithm, we conducted a large-scale all-pairs similarity search for 1.8 million known and potential binding sites in the PDB, and discovered over 14 million similar pairs of binding sites. Here, we present the results as a relational database Pocket Similarity Search using Multiple-sketches (PoSSuM) including all the discovered pairs with annotations of various types. PoSSuM enables rapid exploration of similar binding sites among structures with different global folds as well as similar ones. Moreover, PoSSuM is useful for predicting the binding ligand for unbound structures, which provides important clues for characterizing protein structures with unclear functions. The PoSSuM database is freely available at http://possum.cbrc.jp/PoSSuM/

Predicting mostly disordered proteins by using structure-unknown protein data

BACKGROUND: Predicting intrinsically disordered proteins is important in structural biology because they are thought to carry out various cellular functions even though they have no stable three-dimensional structure. We know the structures of far more ordered proteins than disordered proteins. The structural distribution of proteins in nature can therefore be inferred to differ from that of proteins whose structures have been determined experimentally. We know many more protein sequences than we do protein structures, and many of the known sequences can be expected to be those of disordered proteins. Thus it would be efficient to use the information of structure-unknown proteins in order to avoid training data sparseness. We propose a novel method for predicting which proteins are mostly disordered by using spectral graph transducer and training with a huge amount of structure-unknown sequences as well as structure-known sequences. RESULTS: When the proposed method was evaluated on data that included 82 disordered proteins and 526 ordered proteins, its sensitivity was 0.723 and its specificity was 0.977. It resulted in a Matthews correlation coefficient 0.202 points higher than that obtained using FoldIndex, 0.221 points higher than that obtained using the method based on plotting hydrophobicity against the number of contacts and 0.07 points higher than that obtained using support vector machines (SVMs). To examine robustness against training data sparseness, we investigated the correlation between two results obtained when the method was trained on different datasets and tested on the same dataset. The correlation coefficient for the proposed method is 0.14 higher than that for the method using SVMs. When the proposed SGT-based method was compared with four per-residue predictors (VL3, GlobPlot, DISOPRED2 and IUPred (long)), its sensitivity was 0.834 for disordered proteins, which is 0.052–0.523 higher than that of the per-residue predictors, and its specificity was 0.991 for ordered proteins, which is 0.036–0.153 higher than that of the per-residue predictors. The proposed method was also evaluated on data that included 417 partially disordered proteins. It predicted the frequency of disordered proteins to be 1.95% for the proteins with 5%–10% disordered sequences, 1.46% for the proteins with 10%–20% disordered sequences and 16.57% for proteins with 20%–40% disordered sequences. CONCLUSION: The proposed method, which utilizes the information of structure-unknown data, predicts disordered proteins more accurately than other methods and is less affected by training data sparseness

Evaluation of 3D-Jury on CASP7 models

<p>Abstract</p> <p>Background</p> <p>3D-Jury, the structure prediction consensus method publicly available in the Meta Server <url>http://meta.bioinfo.pl/</url>, was evaluated using models gathered in the 7^{<it>th </it>}round of the Critical Assessment of Techniques for Protein Structure Prediction (CASP7). 3D-Jury is an automated expert process that generates protein structure meta-predictions from sets of models obtained from partner servers.</p> <p>Results</p> <p>The performance of 3D-Jury was analysed for three aspects. First, we examined the correlation between the 3D-Jury score and a model quality measure: the number of correctly predicted residues. The 3D-Jury score was shown to correlate significantly with the number of correctly predicted residues, the correlation is good enough to be used for prediction. 3D-Jury was also found to improve upon the competing servers' choice of the best structure model in most cases. The value of the 3D-Jury score as a generic reliability measure was also examined. We found that the 3D-Jury score separates bad models from good models better than the reliability score of the original server in 27 cases and falls short of it in only 5 cases out of a total of 38. We report the release of a new Meta Server feature: instant 3D-Jury scoring of uploaded user models.</p> <p>Conclusion</p> <p>The 3D-Jury score continues to be a good indicator of structural model quality. It also provides a generic reliability score, especially important for models that were not assigned such by the original server. Individual structure modellers can also benefit from the 3D-Jury scoring system by testing their models in the new instant scoring feature <url>http://meta.bioinfo.pl/compare_your_model_example.pl</url> available in the Meta Server.</p

A New Highly Conserved Antibiotic Sensing/Resistance Pathway in Firmicutes Involves an ABC Transporter Interplaying with a Signal Transduction System

Signal transduction systems and ABC transporters often contribute jointly to adaptive bacterial responses to environmental changes. In Bacillus subtilis, three such pairs are involved in responses to antibiotics: BceRSAB, YvcPQRS and YxdJKLM. They are characterized by a histidine kinase belonging to the intramembrane sensing kinase family and by a translocator possessing an unusually large extracytoplasmic loop. It was established here using a phylogenomic approach that systems of this kind are specific but widespread in Firmicutes, where they originated. The present phylogenetic analyses brought to light a highly dynamic evolutionary history involving numerous horizontal gene transfers, duplications and lost events, leading to a great variety of Bce-like repertories in members of this bacterial phylum. Based on these phylogenetic analyses, it was proposed to subdivide the Bce-like modules into six well-defined subfamilies. Functional studies were performed on members of subfamily IV comprising BceRSAB from B. subtilis, the expression of which was found to require the signal transduction system as well as the ABC transporter itself. The present results suggest, for the members of this subfamily, the occurrence of interactions between one component of each partner, the kinase and the corresponding translocator. At functional and/or structural levels, bacitracin dependent expression of bceAB and bacitracin resistance processes require the presence of the BceB translocator loop. Some other members of subfamily IV were also found to participate in bacitracin resistance processes. Taken together our study suggests that this regulatory mechanism might constitute an important common antibiotic resistance mechanism in Firmicutes. [Supplemental material is available online at http://www.genome.org.