23 research outputs found

    Downregulated expression of HSP27 in human low-grade glioma tissues discovered by a quantitative proteomic analysis

    Get PDF
    <p>Abstract</p> <p>Background</p> <p>Heat shock proteins (HSPs), including mainly HSP110, HSP90, HSP70, HSP60 and small HSP families, are evolutionary conserved proteins involved in various cellular processes. Abnormal expression of HSPs has been detected in several tumor types, which indicates that specific HSPs have different prognostic significance for different tumors. In the current studies, the expression profiling of HSPs in human low-grade glioma tissues (HGTs) were investigated using a sensitive, accurate SILAC (stable isotope labeling with amino acids in cell culture)-based quantitative proteomic strategy.</p> <p>Results</p> <p>The five HSP family members were detected and quantified in both HGTs and autologous para-cancerous brain tissues (PBTs) by the SILAC-based mass spectrometry (MS) simultaneously. HSP90 AB1, HSP A5(70 KDa), and especially HSP27 were significantly downregulated in HGTs, whereas the expression level of HSPA9 (70 KDa) was little higher in HGTs than that in PBTs. It was noted that the downregulation ratio of HSP27 was 0.48-fold in HGTs <it>versus </it>PBTs, which was further validated by results from RT-PCR, western blotting and immunohistochemistry. Furthermore, we detected HSP27 expression changes along with cell growth under heat shock treatment in glioma H4 cells.</p> <p>Conclusion</p> <p>The SILAC-MS technique is an applicable and efficient novel method, with a high-throughput manner, to quantitatively compare the relative expression level of HSPs in brain tumors. Different HSP family members have specific protein expression levels in human low-grade glioma discovered by SILAC-MS analysis. HSP27 expression was obviously downregulated in HGTs <it>versus </it>PBTs, and it exhibited temporal and spatial variation under heat shock treatment (43°C/0-3 h) <it>in vitro</it>. HSP27's rapid upregulation was probably correlated with the temporary resistance to heat shock in order to maintain the survival of human glioma cells.</p

    The CAFA challenge reports improved protein function prediction and new functional annotations for hundreds of genes through experimental screens

    Get PDF
    Background The Critical Assessment of Functional Annotation (CAFA) is an ongoing, global, community-driven effort to evaluate and improve the computational annotation of protein function. Results Here, we report on the results of the third CAFA challenge, CAFA3, that featured an expanded analysis over the previous CAFA rounds, both in terms of volume of data analyzed and the types of analysis performed. In a novel and major new development, computational predictions and assessment goals drove some of the experimental assays, resulting in new functional annotations for more than 1000 genes. Specifically, we performed experimental whole-genome mutation screening in Candida albicans and Pseudomonas aureginosa genomes, which provided us with genome-wide experimental data for genes associated with biofilm formation and motility. We further performed targeted assays on selected genes in Drosophila melanogaster, which we suspected of being involved in long-term memory. Conclusion We conclude that while predictions of the molecular function and biological process annotations have slightly improved over time, those of the cellular component have not. Term-centric prediction of experimental annotations remains equally challenging; although the performance of the top methods is significantly better than the expectations set by baseline methods in C. albicans and D. melanogaster, it leaves considerable room and need for improvement. Finally, we report that the CAFA community now involves a broad range of participants with expertise in bioinformatics, biological experimentation, biocuration, and bio-ontologies, working together to improve functional annotation, computational function prediction, and our ability to manage big data in the era of large experimental screens.Peer reviewe

    The CAFA challenge reports improved protein function prediction and new functional annotations for hundreds of genes through experimental screens

    Get PDF
    BackgroundThe Critical Assessment of Functional Annotation (CAFA) is an ongoing, global, community-driven effort to evaluate and improve the computational annotation of protein function.ResultsHere, we report on the results of the third CAFA challenge, CAFA3, that featured an expanded analysis over the previous CAFA rounds, both in terms of volume of data analyzed and the types of analysis performed. In a novel and major new development, computational predictions and assessment goals drove some of the experimental assays, resulting in new functional annotations for more than 1000 genes. Specifically, we performed experimental whole-genome mutation screening in Candida albicans and Pseudomonas aureginosa genomes, which provided us with genome-wide experimental data for genes associated with biofilm formation and motility. We further performed targeted assays on selected genes in Drosophila melanogaster, which we suspected of being involved in long-term memory.ConclusionWe conclude that while predictions of the molecular function and biological process annotations have slightly improved over time, those of the cellular component have not. Term-centric prediction of experimental annotations remains equally challenging; although the performance of the top methods is significantly better than the expectations set by baseline methods in C. albicans and D. melanogaster, it leaves considerable room and need for improvement. Finally, we report that the CAFA community now involves a broad range of participants with expertise in bioinformatics, biological experimentation, biocuration, and bio-ontologies, working together to improve functional annotation, computational function prediction, and our ability to manage big data in the era of large experimental screens.</p

    BERTMeSH

    Get PDF
    Publisher Copyright: © 2020 The Author(s) 2020. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: [email protected]: With the rapid increase of biomedical articles, large-scale automatic Medical Subject Headings (MeSH) indexing has become increasingly important. FullMeSH, the only method for large-scale MeSH indexing with full text, suffers from three major drawbacks: FullMeSH (i) uses Learning To Rank, which is time-consuming, (ii) can capture some pre-defined sections only in full text and (iii) ignores the whole MEDLINE database. Results: We propose a computationally lighter, full text and deep-learning-based MeSH indexing method, BERTMeSH, which is flexible for section organization in full text. BERTMeSH has two technologies: (i) the state-of-the-art pre-trained deep contextual representation, Bidirectional Encoder Representations from Transformers (BERT), which makes BERTMeSH capture deep semantics of full text. (ii) A transfer learning strategy for using both full text in PubMed Central (PMC) and title and abstract (only and no full text) in MEDLINE, to take advantages of both. In our experiments, BERTMeSHwas pre-trained with 3 million MEDLINE citations and trained on ∼1.5 million full texts in PMC. BERTMeSH outperformed various cutting-edge baselines. For example, for 20 K test articles of PMC, BERTMeSH achieved a Micro F-measure of 69.2%, which was 6.3% higher than FullMeSH with the difference being statistically significant. Also prediction of 20 K test articles needed 5 min by BERTMeSH, while it took more than 10 h by FullMeSH, proving the computational efficiency of BERTMeSH.Peer reviewe

    DeepMHCII: a novel binding core-aware deep interaction model for accurate MHC-II peptide binding affinity prediction

    No full text
    Publisher Copyright: © The Author(s) 2022. Published by Oxford University Press.MOTIVATION: Computationally predicting major histocompatibility complex (MHC)-peptide binding affinity is an important problem in immunological bioinformatics. Recent cutting-edge deep learning-based methods for this problem are unable to achieve satisfactory performance for MHC class II molecules. This is because such methods generate the input by simply concatenating the two given sequences: (the estimated binding core of) a peptide and (the pseudo sequence of) an MHC class II molecule, ignoring biological knowledge behind the interactions of the two molecules. We thus propose a binding core-aware deep learning-based model, DeepMHCII, with a binding interaction convolution layer, which allows to integrate all potential binding cores (in a given peptide) with the MHC pseudo (binding) sequence, through modeling the interaction with multiple convolutional kernels. RESULTS: Extensive empirical experiments with four large-scale datasets demonstrate that DeepMHCII significantly outperformed four state-of-the-art methods under numerous settings, such as 5-fold cross-validation, leave one molecule out, validation with independent testing sets and binding core prediction. All these results and visualization of the predicted binding cores indicate the effectiveness of our model, DeepMHCII, and the importance of properly modeling biological facts in deep learning for high predictive performance and efficient knowledge discovery. AVAILABILITY AND IMPLEMENTATION: DeepMHCII is publicly available at https://github.com/yourh/DeepMHCII. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.Peer reviewe

    DeepGraphGO

    No full text
    Publisher Copyright: © 2021 Oxford University Press. All rights reserved.Motivation: Automated function prediction (AFP) of proteins is a large-scale multi-label classification problem. Two limitations of most network-based methods for AFP are (i) a single model must be trained for each species and (ii) protein sequence information is totally ignored. These limitations cause weaker performance than sequence-based methods. Thus, the challenge is how to develop a powerful network-based method for AFP to overcome these limitations. Results: We propose DeepGraphGO, an end-to-end, multispecies graph neural network-based method for AFP, which makes the most of both protein sequence and high-order protein network information. Our multispecies strategy allows one single model to be trained for all species, indicating a larger number of training samples than existing methods. Extensive experiments with a large-scale dataset show that DeepGraphGO outperforms a number of competing state-of-the-art methods significantly, including DeepGOPlus and three representative network-based methods: GeneMANIA, deepNF and clusDCA. We further confirm the effectiveness of our multispecies strategy and the advantage of DeepGraphGO over so-called difficult proteins. Finally, we integrate DeepGraphGO into the stateof- the-art ensemble method, NetGO, as a component and achieve a further performance improvement. Availability and implementation: https://github.com/yourh/DeepGraphGO.Peer reviewe

    DeepMHCI : an anchor position-aware deep interaction model for accurate MHC-I peptide binding affinity prediction

    No full text
    Publisher Copyright: © The Author(s) 2023. Published by Oxford University Press.MOTIVATION: Computationally predicting major histocompatibility complex class I (MHC-I) peptide binding affinity is an important problem in immunological bioinformatics, which is also crucial for the identification of neoantigens for personalized therapeutic cancer vaccines. Recent cutting-edge deep learning-based methods for this problem cannot achieve satisfactory performance, especially for non-9-mer peptides. This is because such methods generate the input by simply concatenating the two given sequences: a peptide and (the pseudo sequence of) an MHC class I molecule, which cannot precisely capture the anchor positions of the MHC binding motif for the peptides with variable lengths. We thus developed an anchor position-aware and high-performance deep model, DeepMHCI, with a position-wise gated layer and a residual binding interaction convolution layer. This allows the model to control the information flow in peptides to be aware of anchor positions and model the interactions between peptides and the MHC pseudo (binding) sequence directly with multiple convolutional kernels. RESULTS: The performance of DeepMHCI has been thoroughly validated by extensive experiments on four benchmark datasets under various settings, such as 5-fold cross-validation, validation with the independent testing set, external HPV vaccine identification, and external CD8+ epitope identification. Experimental results with visualization of binding motifs demonstrate that DeepMHCI outperformed all competing methods, especially on non-9-mer peptides binding prediction. AVAILABILITY AND IMPLEMENTATION: DeepMHCI is publicly available at https://github.com/ZhuLab-Fudan/DeepMHCI.Peer reviewe

    Advanced Emergency Braking Control Based on a Nonlinear Model Predictive Algorithm for Intelligent Vehicles

    No full text
    Focusing on safety, comfort and with an overall aim of the comprehensive improvement of a vision-based intelligent vehicle, a novel Advanced Emergency Braking System (AEBS) is proposed based on Nonlinear Model Predictive Algorithm. Considering the nonlinearities of vehicle dynamics, a vision-based longitudinal vehicle dynamics model is established. On account of the nonlinear coupling characteristics of the driver, surroundings, and vehicle itself, a hierarchical control structure is proposed to decouple and coordinate the system. To avoid or reduce the collision risk between the intelligent vehicle and collision objects, a coordinated cost function of tracking safety, comfort, and fuel economy is formulated. Based on the terminal constraints of stable tracking, a multi-objective optimization controller is proposed using the theory of non-linear model predictive control. To quickly and precisely track control target in a finite time, an electronic brake controller for AEBS is designed based on the Nonsingular Fast Terminal Sliding Mode (NFTSM) control theory. To validate the performance and advantages of the proposed algorithm, simulations are implemented. According to the simulation results, the proposed algorithm has better integrated performance in reducing the collision risk and improving the driving comfort and fuel economy of the smart car compared with the existing single AEBS

    Development and Characterization a Single-Active-Chamber Piezoelectric Membrane Pump with Multiple Passive Check Valves

    Get PDF
    In order to prevent the backward flow of piezoelectric pumps, this paper presents a single-active-chamber piezoelectric membrane pump with multiple passive check valves. Under the condition of a fixed total number of passive check valves, by means of changing the inlet valves and outlet valves’ configuration, the pumping characteristics in terms of flow rate and backpressure are experimentally investigated. Like the maximum flow rate and backpressure, the testing results show that the optimal frequencies are significantly affected by changes in the number inlet valves and outlet valves. The variation ratios of the maximum flow rate and the maximum backpressure are up to 66% and less than 20%, respectively. Furthermore, the piezoelectric pump generally demonstrates very similar flow rate and backpressure characteristics when the number of inlet valves in one kind of configuration is the same as that of outlet valves in another configuration. The comparison indicates that the backflow from the pumping chamber to inlet is basically the same as the backflow from the outlet to the pumping chamber. No matter whether the number of inlet valves or the number of outlet valves is increased, the backflow can be effectively reduced. In addition, the backpressure fluctuation can be significantly suppressed with an increase of either inlet valves or outlet valves. It also means that the pump can prevent the backflow more effectively at the cost of power consumption. The pump is very suitable for conditions where more accurate flow rates are needed and wear and fatigue of check valves often occur
    corecore