PANET: a GPU-based tool for fast parallel analysis of robustness dynamics and feed-forward/feedback loop structures in large-scale biological networks

Drivergene.net: A Cytoscape app for the identification of driver nodes of large-scale complex networks and case studies in discovery of drug target genes

There are no tools to identify driver nodes of large-scale networks in approach of competition-based controllability. This study proposed a novel method for this computation of large-scale networks. It implemented the method in a new Cytoscape plug-in app called Drivergene.net. Experiments of the software on large-scale biomolecular networks have shown outstanding speed and computing power. Interestingly, 86.67% of the top 10 driver nodes found on these networks are anticancer drug target genes that reside mostly at the innermost K-cores of the networks. Finally, compared method with those of five other researchers and confirmed that the proposed method outperforms the other methods on identification of anticancer drug target genes. Taken together, Drivergene.net is a reliable tool that efficiently detects not only drug target genes from biomolecular networks but also driver nodes of large-scale complex networks. Drivergene.net with a user manual and example datasets are available https://github.com/tinhpd/Drivergene.git.

In Silico Pleiotropy Analysis in KEGG Signaling Networks Using a Boolean Network Model

Pleiotropy, which refers to the ability of different mutations on the same gene to cause different pathological effects in human genetic diseases, is important in understanding system-level biological diseases. Although some biological experiments have been proposed, still little is known about pleiotropy on gene–gene dynamics, since most previous studies have been based on correlation analysis. Therefore, a new perspective is needed to investigate pleiotropy in terms of gene–gene dynamical characteristics. To quantify pleiotropy in terms of network dynamics, we propose a measure called in silico Pleiotropic Scores (sPS), which represents how much a gene is affected against a pair of different types of mutations on a Boolean network model. We found that our model can identify more candidate pleiotropic genes that are not known to be pleiotropic than the experimental database. In addition, we found that many types of functionally important genes tend to have higher sPS values than other genes; in other words, they are more pleiotropic. We investigated the relations of sPS with the structural properties in the signaling network and found that there are highly positive relations to degree, feedback loops, and centrality measures. This implies that the structural characteristics are principles to identify new pleiotropic genes. Finally, we found some biological evidence showing that sPS analysis is relevant to the real pleiotropic data and can be considered a novel candidate for pleiotropic gene research. Taken together, our results can be used to understand the dynamics pleiotropic characteristics in complex biological systems in terms of gene–phenotype relations.

Identification, visualization, statistical analysis and mathematical modeling of high-feedback loops in gene regulatory networks

Background

Feedback loops in gene regulatory networks play pivotal roles in governing functional dynamics of cells. Systems approaches demonstrated characteristic dynamical features, including multistability and oscillation, of positive and negative feedback loops. Recent experiments and theories have implicated highly interconnected feedback loops (high-feedback loops) in additional nonintuitive functions, such as controlling cell differentiation rate and multistep cell lineage progression. However, it remains challenging to identify and visualize high-feedback loops in complex gene regulatory networks due to the myriad of ways in which the loops can be combined. Furthermore, it is unclear whether the high-feedback loop structures with these potential functions are widespread in biological systems. Finally, it remains challenging to understand diverse dynamical features, such as high-order multistability and oscillation, generated by individual networks containing high-feedback loops. To address these problems, we developed HiLoop, a toolkit that enables discovery, visualization, and analysis of several types of high-feedback loops in large biological networks.

Results

HiLoop not only extracts high-feedback structures and visualize them in intuitive ways, but also quantifies the enrichment of overrepresented structures. Through random parameterization of mathematical models derived from target networks, HiLoop presents characteristic features of the underlying systems, including complex multistability and oscillations, in a unifying framework. Using HiLoop, we were able to analyze realistic gene regulatory networks containing dozens to hundreds of genes, and to identify many small high-feedback systems. We found more than a 100 human transcription factors involved in high-feedback loops that were not studied previously. In addition, HiLoop enabled the discovery of an enrichment of high feedback in pathways related to epithelial-mesenchymal transition.

Conclusions

HiLoop makes the study of complex networks accessible without significant computational demands. It can serve as a hypothesis generator through identification and modeling of high-feedback subnetworks, or as a quantification method for motif enrichment analysis. As an example of discovery, we found that multistep cell lineage progression may be driven by either specific instances of high-feedback loops with sparse appearances, or generally enriched topologies in gene regulatory networks. We expect HiLoop’s usefulness to increase as experimental data of regulatory networks accumulate. Code is freely available for use or extension at https://github.com/BenNordick/HiLoop.

Supplementary Information

The online version contains supplementary material available at 10.1186/s12859-021-04405-z.

A novel constrained genetic algorithm-based Boolean network inference method from steady-state gene expression data

MOTIVATION

It is a challenging problem in systems biology to infer both the network structure and dynamics of a gene regulatory network from steady-state gene expression data. Some methods based on Boolean or differential equation models have been proposed but they were not efficient in inference of large-scale networks. Therefore, it is necessary to develop a method to infer the network structure and dynamics accurately on large-scale networks using steady-state expression.

RESULTS

In this study, we propose a novel constrained genetic algorithm-based Boolean network inference (CGA-BNI) method where a Boolean canalyzing update rule scheme was employed to capture coarse-grained dynamics. Given steady-state gene expression data as an input, CGA-BNI identifies a set of path consistency-based constraints by comparing the gene expression level between the wild-type and the mutant experiments. It then searches Boolean networks which satisfy the constraints and induce attractors most similar to steady-state expressions. We devised a heuristic mutation operation for faster convergence and implemented a parallel evaluation routine for execution time reduction. Through extensive simulations on the artificial and the real gene expression datasets, CGA-BNI showed better performance than four other existing methods in terms of both structural and dynamics prediction accuracies. Taken together, CGA-BNI is a promising tool to predict both the structure and the dynamics of a gene regulatory network when a highest accuracy is needed at the cost of sacrificing the execution time.

AVAILABILITY AND IMPLEMENTATION

Source code and data are freely available at https://github.com/csclab/CGA-BNI.

SUPPLEMENTARY INFORMATION

Supplementary data are available at Bioinformatics online.

Effects of ordered mutations on dynamics in signaling networks

BACKGROUND

Many previous clinical studies have found that accumulated sequential mutations are statistically related to tumorigenesis. However, they are limited in fully elucidating the significance of the ordered-mutation because they did not focus on the network dynamics. Therefore, there is a pressing need to investigate the dynamics characteristics induced by ordered-mutations.

METHODS

To quantify the ordered-mutation-inducing dynamics, we defined the mutation-sensitivity and the order-specificity that represent if the network is sensitive against a double knockout mutation and if mutation-sensitivity is specific to the mutation order, respectively, using a Boolean network model.

RESULTS

Through intensive investigations, we found that a signaling network is more sensitive when a double-mutation occurs in the direction order inducing a longer path and a smaller number of paths than in the reverse order. In addition, feedback loops involving a gene pair decreased both the mutation-sensitivity and the order-specificity. Next, we investigated relationships of functionally important genes with ordered-mutation-inducing dynamics. The network is more sensitive to mutations subject to drug-targets, whereas it is less specific to the mutation order. Both the sensitivity and specificity are increased when different-drug-targeted genes are mutated. Further, we found that tumor suppressors can efficiently suppress the amplification of oncogenes when the former are mutated earlier than the latter.

CONCLUSION

Taken together, our results help to understand the importance of the order of mutations with respect to the dynamical effects in complex biological systems.

Neural Differentiation Dynamics Controlled by Multiple Feedback Loops in a Comprehensive Molecular Interaction Network

Mathematical model simulation is a useful method for understanding the complex behavior of a living system. The construction of mathematical models using comprehensive information is one of the techniques of model construction. Such a comprehensive knowledge-based network tends to become a large-scale network. As a result, the variation of analyses is limited to a particular kind of analysis because of the size and complexity of the model. To analyze a large-scale regulatory network of neural differentiation, we propose a contractive method that preserves the dynamic behavior of a large network. The method consists of the following two steps: comprehensive network building and network reduction. The reduction phase can extract network loop structures from a large-scale regulatory network, and the subnetworks were combined to preserve the dynamics of the original large-scale network. We confirmed that the extracted loop combination reproduced the known dynamics of HES1 and ASCL1 before and after differentiation, including oscillation and equilibrium of their concentrations. The model also reproduced the effects of the overexpression and knockdown of the Id2 gene. Our model suggests that the characteristic change in HES1 and ASCL1 expression in the large-scale regulatory network is controlled by a combination of four feedback loops, including a large loop, which has not been focused on. The model extracted by our method has the potential to reveal the critical mechanisms of neural differentiation. The method is applicable to other biological events.

RMut: R package for a Boolean sensitivity analysis against various types of mutations

There have been many in silico studies based on a Boolean network model to investigate network sensitivity against gene or interaction mutations. However, there are no proper tools to examine the network sensitivity against many different types of mutations, including user-defined ones. To address this issue, we developed RMut, which is an R package to analyze the Boolean network-based sensitivity by efficiently employing not only many well-known node-based and edgetic mutations but also novel user-defined mutations. In addition, RMut can specify the mutation area and the duration time for more precise analysis. RMut can be used to analyze large-scale networks because it is implemented in a parallel algorithm using the OpenCL library. In the first case study, we observed that the real biological networks were most sensitive to overexpression/state-flip and edge-addition/-reverse mutations among node-based and edgetic mutations, respectively. In the second case study, we showed that edgetic mutations can predict drug-targets better than node-based mutations. Finally, we examined the network sensitivity to double edge-removal mutations and found an interesting synergistic effect. Taken together, these findings indicate that RMut is a flexible R package to efficiently analyze network sensitivity to various types of mutations. RMut is available at https://github.com/csclab/RMut.

CANA: A Python Package for Quantifying Control and Canalization in Boolean Networks

Logical models offer a simple but powerful means to understand the complex dynamics of biochemical regulation, without the need to estimate kinetic parameters. However, even simple automata components can lead to collective dynamics that are computationally intractable when aggregated into networks. In previous work we demonstrated that automata network models of biochemical regulation are highly canalizing, whereby many variable states and their groupings are redundant (Marques-Pita and Rocha, 2013). The precise charting and measurement of such canalization simplifies these models, making even very large networks amenable to analysis. Moreover, canalization plays an important role in the control, robustness, modularity and criticality of Boolean network dynamics, especially those used to model biochemical regulation (Gates and Rocha, 2016; Gates et al., 2016; Manicka, 2017). Here we describe a new publicly-available Python package that provides the necessary tools to extract, measure, and visualize canalizing redundancy present in Boolean network models. It extracts the pathways most effective in controlling dynamics in these models, including their effective graph and dynamics canalizing map, as well as other tools to uncover minimum sets of control variables.

Construction and analysis of gene-gene dynamics influence networks based on a Boolean model

BACKGROUND

Identification of novel gene-gene relations is a crucial issue to understand system-level biological phenomena. To this end, many methods based on a correlation analysis of gene expressions or structural analysis of molecular interaction networks have been proposed. They have a limitation in identifying more complicated gene-gene dynamical relations, though.

RESULTS

To overcome this limitation, we proposed a measure to quantify a gene-gene dynamical influence (GDI) using a Boolean network model and constructed a GDI network to indicate existence of a dynamical influence for every ordered pair of genes. It represents how much a state trajectory of a target gene is changed by a knockout mutation subject to a source gene in a gene-gene molecular interaction (GMI) network. Through a topological comparison between GDI and GMI networks, we observed that the former network is denser than the latter network, which implies that there exist many gene pairs of dynamically influencing but molecularly non-interacting relations. In addition, a larger number of hub genes were generated in the GDI network. On the other hand, there was a correlation between these networks such that the degree value of a node was positively correlated to each other. We further investigated the relationships of the GDI value with structural properties and found that there are negative and positive correlations with the length of a shortest path and the number of paths, respectively. In addition, a GDI network could predict a set of genes whose steady-state expression is affected in E. coli gene-knockout experiments. More interestingly, we found that the drug-targets with side-effects have a larger number of outgoing links than the other genes in the GDI network, which implies that they are more likely to influence the dynamics of other genes. Finally, we found biological evidences showing that the gene pairs which are not molecularly interacting but dynamically influential can be considered for novel gene-gene relationships.

CONCLUSION

Taken together, construction and analysis of the GDI network can be a useful approach to identify novel gene-gene relationships in terms of the dynamical influence.

Edge-based sensitivity analysis of signaling networks by using Boolean dynamics

MOTIVATION

Biological networks are composed of molecular components and their interactions represented by nodes and edges, respectively, in a graph model. Based on this model, there were many studies with respect to effects of node-based mutations on the network dynamics, whereas little attention was paid to edgetic mutations so far.

RESULTS

In this paper, we defined an edgetic sensitivity measure that quantifies how likely a converging attractor is changed by edge-removal mutations in a Boolean network model. Through extensive simulations based on that measure, we found interesting properties of highly sensitive edges in both random and real signaling networks. First, the sensitive edges in random networks tend to link two end nodes both of which are susceptible to node-knockout mutations. Interestingly, it was analogous to an observation that the sensitive edges in human signaling networks are likely to connect drug-target genes. We further observed that the edgetic sensitivity predicted drug-targets better than the node-based sensitivity. In addition, the sensitive edges showed distinguished structural characteristics such as a lower connectivity, more involving feedback loops and a higher betweenness. Moreover, their gene-ontology enrichments were clearly different from the other edges. We also observed that genes incident to the highly sensitive interactions are more central by forming a considerably large connected component in human signaling networks. Finally, we validated our approach by showing that most sensitive interactions are promising edgetic drug-targets in p53 cancer and T-cell apoptosis networks. Taken together, the edgetic sensitivity is valuable to understand the complex dynamics of signaling networks.

CONTACT

kwonyk@ulsan.ac.kr

SUPPLEMENTARY INFORMATION

Supplementary data are available at Bioinformatics online.

MORO: a Cytoscape app for relationship analysis between modularity and robustness in large-scale biological networks

BACKGROUND

Although there have been many studies revealing that dynamic robustness of a biological network is related to its modularity characteristics, no proper tool exists to investigate the relation between network dynamics and modularity.

RESULTS

Accordingly, we developed a novel Cytoscape app called MORO, which can conveniently analyze the relationship between network modularity and robustness. We employed an existing algorithm to analyze the modularity of directed graphs and a Boolean network model for robustness calculation. In particular, to ensure the robustness algorithm's applicability to large-scale networks, we implemented it as a parallel algorithm by using the OpenCL library. A batch-mode simulation function was also developed to verify whether an observed relationship between modularity and robustness is conserved in a large set of randomly structured networks. The app provides various visualization modes to better elucidate topological relations between modules, and tabular results of centrality and gene ontology enrichment analyses of modules. We tested the proposed app to analyze large signaling networks and showed an interesting relationship between network modularity and robustness.

CONCLUSIONS

Our app can be a promising tool which efficiently analyzes the relationship between modularity and robustness in large signaling networks.

Properties of Boolean dynamics by node classification using feedback loops in a network

Background

Biological networks keep their functions robust against perturbations. Many previous studies through simulations or experiments have shown that feedback loop (FBL) structures play an important role in controlling the network robustness without fully explaining how they do it. Hence, there is a pressing need to more rigorously analyze the influence of FBL structures on network robustness.

Results

In this paper, I propose a novel node classification notion based on the FBL structures involved. More specifically, I classify a node as a no-FBL-in-upstream (NFU) or no-FBL-in-downstream (NFD) node if no feedback loop is involved with any upstream or downstream path of the node, respectively. Based on those definitions, I first prove that every NFU node is eventually frozen in Boolean dynamics. Thus, NFU nodes converge to a fixed value determined by the upstream source nodes. Second, I prove that a network is robust against an arbitrary state perturbation subject to a non-source NFD node. This implies that a network state eventually sustains the attractor despite a perturbation subject to a non-source NFD node. Inspired by this result, I further propose a perturbation-sustainable probability that indicates how likely a perturbation effect is to be sustained through propagations. I show that genes with a high perturbation-sustainable probability are likely to be essential, disease, and drug-target genes in large human signaling networks.

Conclusion

Taken together, these results will promote understanding of the effects of FBL on network robustness in a more rigorous manner.

Electronic supplementary material

The online version of this article (doi:10.1186/s12918-016-0322-z) contains supplementary material, which is available to authorized users.

A HIF-1α-driven feed-forward loop augments HIF signalling in Hep3B cells by upregulation of ARNT

Oxygen-deprived (hypoxic) areas are commonly found within neoplasms caused by excessive cell proliferation. The transcription factor Aryl hydrocarbon receptor nuclear translocator (ARNT) is part of the hypoxia-inducible factor (HIF) pathway, which mediates adaptive responses to ensure cellular survival under hypoxic conditions. HIF signalling leads to metabolic alterations, invasion/metastasis and the induction of angiogenesis in addition to radio-chemoresistance of tumour cells. Activation of the HIF pathway is based on the abundance of HIF-α subunits, which are regulated in an oxygen-dependent manner and form transcriptional active complexes with ARNT or ARNT2 (also referred as HIF-1β and HIF-2β, respectively). ARNT is considered to be unaffected by hypoxia but certain cell lines, including Hep3B cells, are capable to elevate this transcription factor in response to oxygen deprivation, which implies an advantage. Therefore, the aim of this study was to elucidate the mechanism of hypoxia-dependent ARNT upregulation and to determine implications on HIF signalling. Gene silencing and overexpression techniques were used to alter the expression pattern of HIF transcription factors under normoxic and hypoxic conditions. qRT-PCR and western blotting were performed to measure gene and protein expression, respectively. HIF activity was determined by reporter gene assays. The results revealed a HIF-1α-dependent mechanism leading to ARNT upregulation in hypoxia. Forced expression of ARNT increased reporter activity under normoxic and hypoxic conditions. In conclusion, these findings indicate a novel feed-forward loop and suggest that ARNT might be a limiting factor. Augmented HIF signalling in terms of elevated target gene expression might be advantageous for tumour cells.