The ever increasing number of protein structures determined by structural genomic projects has spurred much interest in the development of methods for structure-based function prediction. Existing methods can be roughly classified in two groups: some use a comparative approach looking for the presence of structural motifs possibly associated with a known biochemical function. Other methods try to identify functional patches on the surface of a protein using only its physicochemical characteristics. This review will cover both kinds of approaches to structure-based function prediction as well as their use in real-world cases. The main issues and limitations in using protein structure to predict function will also be discussed. These are mainly: the assessment of the statistical significance of structural similarities and the extent to which these methods depend on the accuracy and availability of structural data.

Influenza is a significant cause of morbidity and mortality worldwide. Here we show changes in the abundance and activation states of more than 50 immune cell subsets in 35 individuals over 11 time points during human A/California/2009 (H1N1) virus challenge monitored using mass cytometry along with other clinical assessments. Peak change in monocyte, B cell, and T cell subset frequencies coincided with peak virus shedding, followed by marked activation of T and NK cells. Results led to the identification of CD38 as a critical regulator of plasmacytoid dendritic cell function in response to influenza virus. Machine learning using study-derived clinical parameters and single-cell data effectively classified and predicted susceptibility to infection. The coordinated immune cell dynamics defined in this study provide a framework for identifying novel correlates of protection in the evaluation of future influenza therapeutics.

The occurrence of very similar structural motifs brought about by different parts of non homologous proteins is often indicative of a common function. Indeed, relatively small local structures can mediate binding to a common partner, be it a protein, a nucleic acid, a cofactor or a substrate. While it is relatively easy to identify short amino acid or nucleotide sequence motifs in a given set of proteins or genes, and many methods do exist for this purpose, much more challenging is the identification of common local substructures, especially if they are formed by non consecutive residues in the sequence. Here we describe a publicly available tool, able to identify common structural motifs shared by different non homologous proteins in an unsupervised mode. The motifs can be as short as three residues and need not to be contiguous or even present in the same order in the sequence. Users can submit a set of protein structures deemed or not to share a common function (e.g. they bind similar ligands, or share a common epitope). The server finds and lists structural motifs composed of three or more spatially well conserved residues shared by at least three of the submitted structures. The method uses a local structural comparison algorithm to identify subsets of similar amino acids between each pair of input protein chains and a clustering procedure to group similarities shared among different structure pairs. FunClust is fast, completely sequence independent, and does not need an a priori knowledge of the motif to be found. The output consists of a list of aligned structural matches displayed in both tabular and graphical form. We show here examples of its usefulness by searching for the largest common structural motifs in test sets of non homologous proteins and showing that the identified motifs correspond to a known common functional feature.

High-parameter single-cell technologies can reveal novel cell populations of interest, but studying or validating these populations using lower-parameter methods remains challenging. Here, we present GateFinder, an algorithm that enriches high-dimensional cell types with simple, stepwise polygon gates requiring only two markers at a time. A series of case studies of complex cell types illustrates how simplified enrichment strategies can enable more efficient assays, reveal novel biomarkers and clarify underlying biology. The GateFinder algorithm is implemented as a free and open-source package for BioConductor: https://nalab.stanford.edu/gatefinder. Supplementary data are available at Bioinformatics online.

While high circulating tumor DNA (ctDNA) levels are associated with poor survival for multiple cancers, variant-specific differences in the association of ctDNA levels and survival have not been examined. Here we investigate KRAS ctDNA (ctKRAS) variant-specific associations with overall and progression-free survival (OS/PFS) in first-line metastatic pancreatic ductal adenocarcinoma (mPDAC) for patients receiving chemoimmunotherapy (“PRINCE”, NCT03214250), and an independent cohort receiving standard of care (SOC) chemotherapy. For PRINCE, higher baseline plasma levels are associated with worse OS for ctKRAS G12D (log-rank p = 0.0010) but not G12V (p = 0.7101), even with adjustment for clinical covariates. Early, on-therapy clearance of G12D (p = 0.0002), but not G12V (p = 0.4058), strongly associates with OS for PRINCE. Similar results are obtained for the SOC cohort, and for PFS in both cohorts. These results suggest ctKRAS G12D but not G12V as a promising prognostic biomarker for mPDAC and that G12D clearance could also serve as an early biomarker of response.

Background The identification of ligand binding sites is a key task in the annotation of proteins with known structure but uncharacterized function. Here we describe a knowledge-based method exploiting the observation that unrelated binding sites share small structural motifs that bind the same chemical fragments irrespective of the nature of the ligand as a whole. Results PDBinder compares a query protein against a library of binding and non-binding protein surface regions derived from the PDB. The results of the comparison are used to derive a propensity value for each residue which is correlated with the likelihood that the residue is part of a ligand binding site. The method was applied to two different problems: i) the prediction of ligand binding residues and ii) the identification of which surface cleft harbours the binding site. In both cases PDBinder performed consistently better than existing methods. PDBinder has been trained on a non-redundant set of 1356 high-quality protein-ligand complexes and tested on a set of 239 holo and apo complex pairs. We obtained an MCC of 0.313 on the holo set with a PPV of 0.413 while on the apo set we achieved an MCC of 0.271 and a PPV of 0.372. Conclusions We show that PDBinder performs better than existing methods. The good performance on the unbound proteins is extremely important for real-world applications where the location of the binding site is unknown. Moreover, since our approach is orthogonal to those used in other programs, the PDBinder propensity value can be integrated in other algorithms further increasing the final performance.