Robust inference of kinase activity using functional networks.
Ontology highlight
ABSTRACT:
SUBMITTER: Y?lmaz S
PROVIDER: S-EPMC7895941 | biostudies-literature | 2021 Feb
REPOSITORIES: biostudies-literature
Publications
Robust inference of kinase activity using functional networks.
Yılmaz Serhan S Ayati Marzieh M Schlatzer Daniela D Çiçek A Ercüment AE Chance Mark R MR Koyutürk Mehmet M
Nature communications 20210219 1
Mass spectrometry enables high-throughput screening of phosphoproteins across a broad range of biological contexts. When complemented by computational algorithms, phospho-proteomic data allows the inference of kinase activity, facilitating the identification of dysregulated kinases in various diseases including cancer, Alzheimer's disease and Parkinson's disease. To enhance the reliability of kinase activity inference, we present a network-based framework, RoKAI, that integrates various sources ...[more]
Similar Datasets
Project description:BackgroundDespite the introduction of targeted therapies, most patients with myeloid malignancies will not be cured and progress. Genomics is useful to elucidate the mutational landscape but remains limited in the prediction of therapeutic outcome and identification of targets for resistance. Dysregulation of phosphorylation-based signaling pathways is a hallmark of cancer, and therefore, kinase-inhibitors are playing an increasingly important role as targeted treatments. Untargeted phosphoproteomics analysis pipelines have been published but show limitations in inferring kinase-activities and identifying potential biomarkers of response and resistance.MethodsWe developed a phosphoproteomics workflow based on titanium dioxide phosphopeptide enrichment with subsequent analysis by liquid chromatography tandem mass spectrometry (LC-MS). We applied a novel Kinase-Activity Enrichment Analysis (KAEA) pipeline on differential phosphoproteomics profiles, which is based on the recently published SetRank enrichment algorithm with reduced false positive rates. Kinase activities were inferred by this algorithm using an extensive reference database comprising five experimentally validated kinase-substrate meta-databases complemented with the NetworKIN in-silico prediction tool. For the proof of concept, we used human myeloid cell lines (K562, NB4, THP1, OCI-AML3, MOLM13 and MV4-11) with known oncogenic drivers and exposed them to clinically established kinase-inhibitors.ResultsBiologically meaningful over- and under-active kinases were identified by KAEA in the unperturbed human myeloid cell lines (K562, NB4, THP1, OCI-AML3 and MOLM13). To increase the inhibition signal of the driving oncogenic kinases, we exposed the K562 (BCR-ABL1) and MOLM13/MV4-11 (FLT3-ITD) cell lines to either Nilotinib or Midostaurin kinase inhibitors, respectively. We observed correct detection of expected direct (ABL, KIT, SRC) and indirect (MAPK) targets of Nilotinib in K562 as well as indirect (PRKC, MAPK, AKT, RPS6K) targets of Midostaurin in MOLM13/MV4-11, respectively. Moreover, our pipeline was able to characterize unexplored kinase-activities within the corresponding signaling networks.ConclusionsWe developed and validated a novel KAEA pipeline for the analysis of differential phosphoproteomics MS profiling data. We provide translational researchers with an improved instrument to characterize the biological behavior of kinases in response or resistance to targeted treatment. Further investigations are warranted to determine the utility of KAEA to characterize mechanisms of disease progression and treatment failure using primary patient samples.
| S-EPMC8268341 | biostudies-literature
Project description:MOTIVATION:A major challenge in molecular and cellular biology is to map out the regulatory networks of cells. As regulatory interactions can typically not be directly observed experimentally, various computational methods have been proposed to disentangling direct and indirect effects. Most of these rely on assumptions that are rarely met or cannot be adapted to a given context. RESULTS:We present a network inference method that is based on a simple response logic with minimal presumptions. It requires that we can experimentally observe whether or not some of the system's components respond to perturbations of some other components, and then identifies the directed networks that most accurately account for the observed propagation of the signal. To cope with the intractable number of possible networks, we developed a logic programming approach that can infer networks of hundreds of nodes, while being robust to noisy, heterogeneous or missing data. This allows to directly integrate prior network knowledge and additional constraints such as sparsity. We systematically benchmark our method on KEGG pathways, and show that it outperforms existing approaches in DREAM3 and DREAM4 challenges. Applied to a novel perturbation dataset on PI3K and MAPK pathways in isogenic models of a colon cancer cell line, it generates plausible network hypotheses that explain distinct sensitivities toward various targeted inhibitors due to different PI3K mutants. AVAILABILITY AND IMPLEMENTATION:A Python/Answer Set Programming implementation can be accessed at github.com/GrossTor/response-logic. Data and analysis scripts are available at github.com/GrossTor/response-logic-projects. SUPPLEMENTARY INFORMATION:Supplementary data are available at Bioinformatics online.
| S-EPMC6612863 | biostudies-other
Project description:MotivationPhosphoproteomic experiments are increasingly used to study the changes in signaling occurring across different conditions. It has been proposed that changes in phosphorylation of kinase target sites can be used to infer when a kinase activity is under regulation. However, these approaches have not yet been benchmarked due to a lack of appropriate benchmarking strategies.ResultsWe used curated phosphoproteomic experiments and a gold standard dataset containing a total of 184 kinase-condition pairs where regulation is expected to occur to benchmark and compare different kinase activity inference strategies: Z-test, Kolmogorov Smirnov test, Wilcoxon rank sum test, gene set enrichment analysis (GSEA), and a multiple linear regression model. We also tested weighted variants of the Z-test and GSEA that include information on kinase sequence specificity as proxy for affinity. Finally, we tested how the number of known substrates and the type of evidence ( in vivo , in vitro or in silico ) supporting these influence the predictions.ConclusionsMost models performed well with the Z-test and the GSEA performing best as determined by the area under the ROC curve (Mean AUC = 0.722). Weighting kinase targets by the kinase target sequence preference improves the results marginally. However, the number of known substrates and the evidence supporting the interactions has a strong effect on the predictions.Availability and implementationThe KSEA implementation is available in https://github.com/ evocellnet/ksea. Additional data is available in http://phosfate.com.Contactpbeltrao@ebi.ac.uk or ochoa@ebi.ac.uk.Supplementary informationSupplementary data are available at Bioinformatics online.
| S-EPMC5870625 | biostudies-literature
Project description:16S ribosomal RNA (rRNA) gene and other environmental sequencing techniques provide snapshots of microbial communities, revealing phylogeny and the abundances of microbial populations across diverse ecosystems. While changes in microbial community structure are demonstrably associated with certain environmental conditions (from metabolic and immunological health in mammals to ecological stability in soils and oceans), identification of underlying mechanisms requires new statistical tools, as these datasets present several technical challenges. First, the abundances of microbial operational taxonomic units (OTUs) from amplicon-based datasets are compositional. Counts are normalized to the total number of counts in the sample. Thus, microbial abundances are not independent, and traditional statistical metrics (e.g., correlation) for the detection of OTU-OTU relationships can lead to spurious results. Secondly, microbial sequencing-based studies typically measure hundreds of OTUs on only tens to hundreds of samples; thus, inference of OTU-OTU association networks is severely under-powered, and additional information (or assumptions) are required for accurate inference. Here, we present SPIEC-EASI (SParse InversE Covariance Estimation for Ecological Association Inference), a statistical method for the inference of microbial ecological networks from amplicon sequencing datasets that addresses both of these issues. SPIEC-EASI combines data transformations developed for compositional data analysis with a graphical model inference framework that assumes the underlying ecological association network is sparse. To reconstruct the network, SPIEC-EASI relies on algorithms for sparse neighborhood and inverse covariance selection. To provide a synthetic benchmark in the absence of an experimentally validated gold-standard network, SPIEC-EASI is accompanied by a set of computational tools to generate OTU count data from a set of diverse underlying network topologies. SPIEC-EASI outperforms state-of-the-art methods to recover edges and network properties on synthetic data under a variety of scenarios. SPIEC-EASI also reproducibly predicts previously unknown microbial associations using data from the American Gut project.
| S-EPMC4423992 | biostudies-literature
Project description:Despite the indisputable efficacy of kinase-inhibitors in myeloid malignancies, cure remains an exception and most patients eventually progress. Therefore, there is an unmet clinical need in developing diagnostic pipelines for the characterization of kinase-activities and signaling networks to investigate their implications in response and resistance. Here, we used the BCR-ABL1 driven K562 and hetero-/homozygote FLT3-ITD driven MOLM13/MV4-11 human myeloid cell line models exposed to the clinically established BCR-ABL1 and FLT3 kinase-inhibitors, Nilotinib and Midostaurin, respectively. Titanium dioxide enrichment with liquid chromatography tandem mass spectrometry (LC-MS) was used and the differential phosphoproteomics profiles analyzed with the Kinase-Activity Enrichment Analysis (KAEA) pipeline. This novel pipeline allows inferring kinase activities within signaling networks. We observed correct detection of expected direct (ABL, KIT, SRC) and indirect (MAPK) targets of Nilotinib as well as the indirect (PRKC, MAPK, AKT, RPS6K) targets of Midostaurin, respectively. Moreover, our pipeline was able to characterize unexplored kinase-activities within the corresponding signaling networks. With our pipeline, we provide researchers and clinicians an instrument to monitor biological behavior of kinases in response or resistance to targeted treatment. Further investigations are warranted and ongoing to determine the utility of our pipeline to characterize mechanisms of disease progression and treatment failure.
2021-09-10 | PXD024806 | Pride
Project description:MotivationThe application of machine learning approaches in phylogenetics has been impeded by the vast model space associated with inference. Supervised machine learning approaches require data from across this space to train models. Because of this, previous approaches have typically been limited to inferring relationships among unrooted quartets of taxa, where there are only three possible topologies. Here, we explore the potential of generative adversarial networks (GANs) to address this limitation. GANs consist of a generator and a discriminator: at each step, the generator aims to create data that is similar to real data, while the discriminator attempts to distinguish generated and real data. By using an evolutionary model as the generator, we use GANs to make evolutionary inferences. Since a new model can be considered at each iteration, heuristic searches of complex model spaces are possible. Thus, GANs offer a potential solution to the challenges of applying machine learning in phylogenetics.ResultsWe developed phyloGAN, a GAN that infers phylogenetic relationships among species. phyloGAN takes as input a concatenated alignment, or a set of gene alignments, and infers a phylogenetic tree either considering or ignoring gene tree heterogeneity. We explored the performance of phyloGAN for up to 15 taxa in the concatenation case and 6 taxa when considering gene tree heterogeneity. Error rates are relatively low in these simple cases. However, run times are slow and performance metrics suggest issues during training. Future work should explore novel architectures that may result in more stable and efficient GANs for phylogenetics.Availability and implementationphyloGAN is available on github: https://github.com/meganlsmith/phyloGAN/.
| S-EPMC10500083 | biostudies-literature
Project description:Predicting the function of a protein from its amino acid sequence is a long-standing challenge in bioinformatics. Traditional approaches use sequence alignment to compare a query sequence either to thousands of models of protein families or to large databases of individual protein sequences. Here we introduce ProteInfer, which instead employs deep convolutional neural networks to directly predict a variety of protein functions - Enzyme Commission (EC) numbers and Gene Ontology (GO) terms - directly from an unaligned amino acid sequence. This approach provides precise predictions which complement alignment-based methods, and the computational efficiency of a single neural network permits novel and lightweight software interfaces, which we demonstrate with an in-browser graphical interface for protein function prediction in which all computation is performed on the user's personal computer with no data uploaded to remote servers. Moreover, these models place full-length amino acid sequences into a generalised functional space, facilitating downstream analysis and interpretation. To read the interactive version of this paper, please visit https://google-research.github.io/proteinfer/.
| S-EPMC10063232 | biostudies-literature
Project description:Gene regulatory networks (GRNs) drive organism structure and functions, so the discovery and characterization of GRNs is a major goal in biological research. However, accurate identification of causal regulatory connections and inference of GRNs using gene expression datasets, more recently from single-cell RNA-seq (scRNA-seq), has been challenging. Here we employ the innovative method of Causal Inference Using Composition of Transactions (CICT) to uncover GRNs from scRNA-seq data. The basis of CICT is that if all gene expressions were random, a non-random regulatory gene should induce its targets at levels different from the background random process, resulting in distinct patterns in the whole relevance network of gene-gene associations. CICT proposes novel network features derived from a relevance network, which enable any machine learning algorithm to predict causal regulatory edges and infer GRNs. We evaluated CICT using simulated and experimental scRNA-seq data in a well-established benchmarking pipeline and showed that CICT outperformed existing network inference methods representing diverse approaches with many-fold higher accuracy. Furthermore, we demonstrated that GRN inference with CICT was robust to different levels of sparsity in scRNA-seq data, the characteristics of data and ground truth, the choice of association measure and the complexity of the supervised machine learning algorithm. Our results suggest aiming at directly predicting causality to recover regulatory relationships in complex biological networks substantially improves accuracy in GRN inference.
| S-EPMC10612495 | biostudies-literature
Project description:MotivationTranscriptional regulation mechanisms allow cells to adapt and respond to external stimuli by altering gene expression. The possible cell transcriptional states are determined by the underlying gene regulatory network (GRN), and reliably inferring such network would be invaluable to understand biological processes and disease progression.ResultsIn this article, we present a novel method for the inference of GRNs, called PORTIA, which is based on robust precision matrix estimation, and we show that it positively compares with state-of-the-art methods while being orders of magnitude faster. We extensively validated PORTIA using the DREAM and MERLIN+P datasets as benchmarks. In addition, we propose a novel scoring metric that builds on graph-theoretical concepts.Availability and implementationThe code and instructions for data acquisition and full reproduction of our results are available at https://github.com/AntoinePassemiers/PORTIA-Manuscript. PORTIA is available on PyPI as a Python package (portia-grn).Supplementary informationSupplementary data are available at Bioinformatics online.
| S-EPMC9113237 | biostudies-literature
Project description:Functional networks play an important role in the analysis of biological processes and systems. The inference of these networks from high-throughput (-omics) data is an area of intense research. So far, the similarity-based inference paradigm (e.g. gene co-expression) has been the most popular approach. It assumes a functional relationship between genes which are expressed at similar levels across different samples. An alternative to this paradigm is the inference of relationships from the structure of machine learning models. These models are able to capture complex relationships between variables, that often are different/complementary to the similarity-based methods.We propose a protocol to infer functional networks from machine learning models, called FuNeL. It assumes, that genes used together within a rule-based machine learning model to classify the samples, might also be functionally related at a biological level. The protocol is first tested on synthetic datasets and then evaluated on a test suite of 8 real-world datasets related to human cancer. The networks inferred from the real-world data are compared against gene co-expression networks of equal size, generated with 3 different methods. The comparison is performed from two different points of view. We analyse the enriched biological terms in the set of network nodes and the relationships between known disease-associated genes in a context of the network topology. The comparison confirms both the biological relevance and the complementary character of the knowledge captured by the FuNeL networks in relation to similarity-based methods and demonstrates its potential to identify known disease associations as core elements of the network. Finally, using a prostate cancer dataset as a case study, we confirm that the biological knowledge captured by our method is relevant to the disease and consistent with the specialised literature and with an independent dataset not used in the inference process.The implementation of our network inference protocol is available at: http://ico2s.org/software/funel.html.
| S-EPMC5011349 | biostudies-literature