Prostate Cancer Gene Regulatory Network Inferred from RNA-Seq Data

Inferring gene regulatory networks using transcriptional profiles as dynamical attractors

Genetic regulatory networks (GRNs) regulate the flow of genetic information from the genome to expressed messenger RNAs (mRNAs) and thus are critical to controlling the phenotypic characteristics of cells. Numerous methods exist for profiling mRNA transcript levels and identifying protein-DNA binding interactions at the genome-wide scale. These enable researchers to determine the structure and output of transcriptional regulatory networks, but uncovering the complete structure and regulatory logic of GRNs remains a challenge. The field of GRN inference aims to meet this challenge using computational modeling to derive the structure and logic of GRNs from experimental data and to encode this knowledge in Boolean networks, Bayesian networks, ordinary differential equation (ODE) models, or other modeling frameworks. However, most existing models do not incorporate dynamic transcriptional data since it has historically been less widely available in comparison to "static" transcriptional data. We report the development of an evolutionary algorithm-based ODE modeling approach (named EA) that integrates kinetic transcription data and the theory of attractor matching to infer GRN architecture and regulatory logic. Our method outperformed six leading GRN inference methods, none of which incorporate kinetic transcriptional data, in predicting regulatory connections among TFs when applied to a small-scale engineered synthetic GRN in Saccharomyces cerevisiae. Moreover, we demonstrate the potential of our method to predict unknown transcriptional profiles that would be produced upon genetic perturbation of the GRN governing a two-state cellular phenotypic switch in Candida albicans. We established an iterative refinement strategy to facilitate candidate selection for experimentation; the experimental results in turn provide validation or improvement for the model. In this way, our GRN inference approach can expedite the development of a sophisticated mathematical model that can accurately describe the structure and dynamics of the in vivo GRN.

From time-series transcriptomics to gene regulatory networks: A review on inference methods

Inference of gene regulatory networks has been an active area of research for around 20 years, leading to the development of sophisticated inference algorithms based on a variety of assumptions and approaches. With the ever increasing demand for more accurate and powerful models, the inference problem remains of broad scientific interest. The abstract representation of biological systems through gene regulatory networks represents a powerful method to study such systems, encoding different amounts and types of information. In this review, we summarize the different types of inference algorithms specifically based on time-series transcriptomics, giving an overview of the main applications of gene regulatory networks in computational biology. This review is intended to give an updated reference of regulatory networks inference tools to biologists and researchers new to the topic and guide them in selecting the appropriate inference method that best fits their questions, aims, and experimental data.

Benchmarking Gene Regulatory Network Inference Methods on Simulated and Experimental Data

Although the challenge of gene regulatory network inference has been studied for more than a decade, it is still unclear how well network inference methods work when applied to real data. Attempts to benchmark these methods on experimental data have yielded mixed results, in which sometimes even the best methods fail to outperform random guessing, and in other cases they perform reasonably well. So, one of the most valuable contributions one can currently make to the field of network inference is to benchmark methods on experimental data for which the true underlying network is already known, and report the results so that we can get a clearer picture of their efficacy. In this paper, we report results from the first, to our knowledge, benchmarking of network inference methods on single cell E. coli transcriptomic data. We report a moderate level of accuracy for the methods, better than random chance but still far from perfect. We also find that some methods that were quite strong and accurate on microarray and bulk RNA-seq data did not perform as well on the single cell data. Additionally, we benchmark a simple network inference method (Pearson correlation), on data generated through computer simulations in order to draw conclusions about general best practices in network inference studies. We predict that network inference would be more accurate using proteomic data rather than transcriptomic data, which could become relevant if high-throughput proteomic experimental methods are developed in the future. We also show through simulations that using a simplified model of gene expression that skips the mRNA step tends to substantially overestimate the accuracy of network inference methods, and advise against using this model for future in silico benchmarking studies.

Study of transcription factor druggabilty for prostate cancer using structure information, gene regulatory networks and protein moonlighting

Prostate cancer is the second leading cause of cancer-related death in men. Metastasis shows poor survival even though the recovery rate is high. In spite of numerous studies regarding prostate carcinoma, multiple questions are still unanswered. In this regards, gene regulatory network can uncover the mechanisms behind cancer progression, and metastasis. Under a feed forward loop, transcription factors (TFs) can be a good druggable candidate. We have proposed a computational model to study the uncertainty of TFs and suggest the appropriate cellular conditions for drug targeting. We have selected feed-forward loops depending on the shared list of the functional annotations among TFs, genes and miRNAs. From the potential feed forward loop cores, six TFs were identified as druggable targets, which include AR, CEBPB, CREB1, ETS1, NFKB1 and RELA. However, TFs are known for their Protein Moonlighting properties, which provide unrelated multi-functionalities within the same or different subcellular localizations. Following that, we have identified such functions that are suitable for drug targeting. On the other hand, we have tried to identify membraneless organelles for providing more specificity to the proposed time and space theory. The study has provided certain possibilities on TF-based therapeutics. The controlled dynamic nature of the TF may have enhanced the chances where TFs can be considered as one of the prime drug targets. Finally, the combination of membranless phase separation and protein moonlighting has provided possible druggable period within the biological clock.

Co-Targeting Plk1 and DNMT3a in Advanced Prostate Cancer

Because there is no effective treatment for late-stage prostate cancer (PCa) at this moment, identifying novel targets for therapy of advanced PCa is urgently needed. A new network-based systems biology approach, XDeath, is developed to detect crosstalk of signaling pathways associated with PCa progression. This unique integrated network merges gene causal regulation networks and protein-protein interactions to identify novel co-targets for PCa treatment. The results show that polo-like kinase 1 (Plk1) and DNA methyltransferase 3A (DNMT3a)-related signaling pathways are robustly enhanced during PCa progression and together they regulate autophagy as a common death mode. Mechanistically, it is shown that Plk1 phosphorylation of DNMT3a leads to its degradation in mitosis and that DNMT3a represses Plk1 transcription to inhibit autophagy in interphase, suggesting a negative feedback loop between these two proteins. Finally, a combination of the DNMT inhibitor 5-Aza-2'-deoxycytidine (5-Aza) with inhibition of Plk1 suppresses PCa synergistically.

Establishing a consensus for the hallmarks of cancer based on gene ontology and pathway annotations

BACKGROUND

The hallmarks of cancer provide a highly cited and well-used conceptual framework for describing the processes involved in cancer cell development and tumourigenesis. However, methods for translating these high-level concepts into data-level associations between hallmarks and genes (for high throughput analysis), vary widely between studies. The examination of different strategies to associate and map cancer hallmarks reveals significant differences, but also consensus.

RESULTS

Here we present the results of a comparative analysis of cancer hallmark mapping strategies, based on Gene Ontology and biological pathway annotation, from different studies. By analysing the semantic similarity between annotations, and the resulting gene set overlap, we identify emerging consensus knowledge. In addition, we analyse the differences between hallmark and gene set associations using Weighted Gene Co-expression Network Analysis and enrichment analysis.

CONCLUSIONS

Reaching a community-wide consensus on how to identify cancer hallmark activity from research data would enable more systematic data integration and comparison between studies. These results highlight the current state of the consensus and offer a starting point for further convergence. In addition, we show how a lack of consensus can lead to large differences in the biological interpretation of downstream analyses and discuss the challenges of annotating changing and accumulating biological data, using intermediate knowledge resources that are also changing over time.

Computational Identification of Gene Networks as a Biomarker of Neuroblastoma Risk

Neuroblastoma is a common cancer in children, affected by a number of genes that interact with each other through intricate but coordinated networks. Traditional approaches can only reconstruct a single regulatory network that is topologically not informative enough to explain the complexity of neuroblastoma risk. We implemented and modified an advanced model for recovering informative, omnidirectional, dynamic, and personalized networks (idopNetworks) from static gene expression data for neuroblastoma risk. We analyzed 3439 immune genes of neuroblastoma for 217 high-risk patients and 30 low-risk patients by which to reconstruct large patient-specific idopNetworks. By converting these networks into risk-specific representations, we found that the shift in patients from a low to high risk or from a high to low risk might be due to the reciprocal change of hub regulators. By altering the directions of regulation exerted by these hubs, it may be possible to reduce a high risk to a low risk. Results from a holistic, systems-oriented paradigm through idopNetworks can potentially enable oncologists to experimentally identify the biomarkers of neuroblastoma and other cancers.

Network inference in systems biology: recent developments, challenges, and applications

One of the most interesting, difficult, and potentially useful topics in computational biology is the inference of gene regulatory networks (GRNs) from expression data. Although researchers have been working on this topic for more than a decade and much progress has been made, it remains an unsolved problem and even the most sophisticated inference algorithms are far from perfect. In this paper, we review the latest developments in network inference, including state-of-the-art algorithms like PIDC, Phixer, and more. We also discuss unsolved computational challenges, including the optimal combination of algorithms, integration of multiple data sources, and pseudo-temporal ordering of static expression data. Lastly, we discuss some exciting applications of network inference in cancer research, and provide a list of useful software tools for researchers hoping to conduct their own network inference analyses.

Patient-specific multi-omics models and the application in personalized combination therapy

The rapid advancement of high-throughput technologies and sharp decrease in cost have opened up the possibility to generate large amount of multi-omics data on an individual basis. The development of high-throughput -omics, including genomics, epigenomics, transcriptomics, proteomics, metabolomics and microbiomics, enables the application of multi-omics technologies in the clinical settings. Combination therapy, defined as disease treatment with two or more drugs to achieve efficacy with lower doses or lower drug toxicity, is the basis for the care of diseases like cancer. Patient-specific multi-omics data integration can help the identification and development of combination therapies. In this review, we provide an overview of different -omics platforms, and discuss the methods for multi-omics, high-throughput, data integration, personalized combination therapy.