Open Access

Inferring interaction type in gene regulatory networks using co-expression data

Contributed equally
Algorithms for Molecular Biology201510:23

DOI: 10.1186/s13015-015-0054-4

Received: 11 April 2014

Accepted: 16 June 2015

Published: 8 July 2015

The Erratum to this article has been published in Algorithms for Molecular Biology 2015 10:25



Knowledge of interaction types in biological networks is important for understanding the functional organization of the cell. Currently information-based approaches are widely used for inferring gene regulatory interactions from genomics data, such as gene expression profiles; however, these approaches do not provide evidence about the regulation type (positive or negative sign) of the interaction.


This paper describes a novel algorithm, “Signing of Regulatory Networks” (SIREN), which can infer the regulatory type of interactions in a known gene regulatory network (GRN) given corresponding genome-wide gene expression data. To assess our new approach, we applied it to three different benchmark gene regulatory networks, including Escherichia coli, prostate cancer, and an in silico constructed network. Our new method has approximately 68, 70, and 100 percent accuracy, respectively, for these networks. To showcase the utility of SIREN algorithm, we used it to predict previously unknown regulation types for 454 interactions related to the prostate cancer GRN.


SIREN is an efficient algorithm with low computational complexity; hence, it is applicable to large biological networks. It can serve as a complementary approach for a wide range of network reconstruction methods that do not provide information about the interaction type.


Gene expression data Information-based approach Interaction type Regulatory interaction


With increasing amounts of biological data generated by modern high-throughput technologies, we are faced with a challenging problem: how to extract meaningful information from the data. A prominent direction for addressing this problem is using computational data mining approaches for the analysis of high-throughput biological data, such as gene expression data [14]. In particular, analysis methods have been developed to infer regulatory interactions from transcriptome data [514].These regulatory interactions link regulators, such as transcription factors and kinases, to their targets and may include the regulatory type of the interaction, which indicates whether there is an activating (positive) or inhibitory (negative) association between the interactor pair. Knowing the interaction type can be beneficial for a wide range of analyses including module-centric analysis [15] and network simulation [16]. A growing number of approaches use co-expression measures, either correlation-based (generally linear) or information theory-based (can consider non-linear relationships) [17], to infer GRNs.

Although information theory-based approaches have been widely applied to decipher GRNs [1820], they are not currently used to determine the type of the regulation between two connected genes in a reconstructed GRN. Here, we present SIREN, a statistical framework that uses a new information theory-based measure to predict regulatory type. Our novel framework is capable of accurately predicting the type of regulation between two interacting genes. The fundamental assumption in our approach is that if two connected genes in the network have similar expression patterns, there is likely an activating (positive) association, among them. On the other hand, if their expression patterns are anti-correlated, the interacting genes likely have an inhibitory (negative) influence on each other. SIREN uses a mutual information-based measure to predict the interaction type. Extending mutual information has been extensively used as a similarity measure for feature selection fields [2124]. In our novel approach, a rescaling matrix was introduced to convert the MI function, which normally generates non-negative scores, to a function that can have negative values. The resulting sign is used to predict the interaction type. While SIREN detects the regulation type, it cannot detect the direction of regulation. We evaluated SIREN by testing it on E. coli, prostate cancer, and in silico GRN benchmarks. In each case, SIREN reliably identified positive and negative regulatory types. Besides, comparison of SIREN with a baseline method based on Pearson coefficient correlation (PCC) revealed that it has a greater performance on biological GRNs. The R implementation of the algorithm is freely available at


Information theory based metrics

Mutual information (MI) is a measure of the information dependency between two random variables, defined as:
$$MI = \sum {p(x,y)\log (p(x,y)/p(x)p(y))}$$
where p(x,y) is the joint probability of x and y and p(x) and p(y) are marginal probabilities.

If we define the function \(f(x,y) = \log (p(x,y)/p(x)p(y))\), then \(MI = \sum {p(x,y)f(x,y)}\) which is equivalent to the expected value of function f(x,y), i.e., \(MI = E(f(x,y))\). \(f(x,y)\) is defined to be the point-wise mutual information (PMI) [25]. PMI is a measure of how much the joint probability of a particular co-occurrence of events, p(x,y), differs from the expected joint probability, assuming the independence of x and y, p(x)*p(y) [25].

Discretization of continuous data

For a computationally feasible calculation of MI and PMI, discretizing and binning of the expression data is required. In conventional binning approaches, each data point is assigned to exactly one bin. This can be problematic for data points close to the margins between bins: small, noisy fluctuations may cause these data points to be improperly assigned to a neighboring bin. Additionally, the choice of bin size can strongly influence the MI values for datasets of moderate size [26, 27]. To address these problems, we used a B-spline approach for data binning [2730] that allows each data point to be assigned to multiple bins. To accomplish this, the indicator function, which typically maps each data point to a specific bin, was improved to allow each data-point to be assigned to several bins, with weights obtained from a B-spline function summing to one (schematically shown in Additional file 1: Figure S1). The B-spline function has a spline order that defines the shape of the function and influences the number of bins to which each data point is assigned.

For the discretization of continuous expression data in SIREN, we tested different number of bins and the spline orders. Consistent with previous studies [27], we found the number of bins does not affect the SIREN performance remarkably as long as it is within a reasonable range (Figure 1a) and using spline order greater than three does not improve the quality of prediction significantly (Figure 1b), but rather it increases the computational cost of the algorithm.
Figure 1

Accuracy-retrieval curves (ARCs) for different number of bins and spline orders. The relationship between accuracy and retrieval for different a number of bins and b spline orders on prostate cancer network. NB number of bins, SO spline order.

MI versus correlation based methods

Both MI and correlation are measures of dependency between two random variables. MI calculates the amount of information that two genes provide about each other and is always a non-negative value. Consequently, a higher mutual information value for two genes indicates that one gene is non-randomly related with the other [19]. The Pearson correlation coefficient (PCC) is a measure that indicates the intensity and trend of the linear relationship between two variables [31]. Despite the fact that the PCC can characterize linear correlations with Gaussian noise, the mutual information measure is more powerful mainly because it is able to detect non-linear dependencies that are invisible to PCC [27, 32]. Both PCC [3337] and MI [6, 18, 27, 3841] have been used to capture dependencies between random variables (e.g., genes).

Benchmarks GRNs and corresponding data

To assess our algorithm, we applied SIREN to three benchmark GRNs with associated gene expression data (Additional file 2).

In silico constructed GRN

To assess the performance of SIREN on a completely known network, we constructed an in silico GRN based on a prostate cancer gene expression data. This GRN is a clique network composed of two groups of genes. Genes in each group have a similar expression pattern to each other and opposite pattern with members of the other group (Figure 2). Because there is a clear expression pattern for each gene, we know the putative interaction types in this network by visual inspection.
Figure 2

Heatmap of selected genes for the in silico network. The heatmap composed of two groups of genes. Genes in each group have similar expression pattern with each other while have opposite pattern with members of the other group. Genes in the red and blue parts are consistently up-regulated and down-regulated, respectively, during cancer progression. These groups of genes were selected based on the prostate cancer expression data.

Prostate cancer GRN

We extracted the prostate cancer GRN from the STRING functional interaction database [42], considering only regulatory interactions among genes with changed expression levels during cancer progression. To determine these genes, we focused on those which are up- or down-regulated significantly (fold change ≥2 and p value ≤0.05) in at least one state, considering the normal state as control. Thus the GRN is composed of genes which putatively play a role in prostate cancer and contains 1,436 interactions among 526 genes (53.8% of total genes with available transcriptome data).

Prostate cancer microarray data

We extracted gene expression data from the GEO database with accession number GDS2545. This dataset consists of 171 samples monitoring gene expression in four different cell states: normal prostate tissue free of any pathology (normal), normal prostate tissue adjacent to tumor (adjacent), primary prostate tumor tissue (tumor), and metastatic prostate cancer tissue (metastatic) [43].

E. coli high confidence GRN

We extracted the high confidence GRN of E. coli from the RegulonDB database [44]. This GRN contains 4,005 experimentally confirmed regulatory interactions among 1,696 genes. We created a sub-network from RegulonDB GRN by considering genes with available data in our transcriptomics data set. The resulting sub-network contains 2,687 interactions among 1,419 genes and was used for further analysis.

E. coli gene expression data

We extracted a microarray dataset consisting of 907 samples from the Many Microbe Microarray Database (M3D) Web site [45].

SIREN algorithm

The fundamental assumption in our approach is that if two connected genes in the network have similar expression patterns, there is likely an activating (positive) association, between them. On the other hand, if their expression patterns are conversely related, the interacting genes likely have an inhibitory (negative) influence on each other.

Our method is useful for the analysis of reconstructed GRNs from any reconstruction method used to generate the input network. In addition to the GRN, SIREN also needs corresponding expression data. SIREN determines the regulation type for each pair of connected genes in the network by computing a similarity score between their expression profiles. As shown schematically in Additional file 1: Figure S2, SIREN determines the similarity between the expression profiles of two genes in four steps: (1) a B-spline discretization method is used to discretize expression data into ten bins, allowing overlap between bins to smooth the data as described in [27], (2) co-occurrence scores are calculated for each combination of bins of the genes (for example the first bin of first gene with the first bin of second gene, the first bin of first gene with the second bin of second gene, etc.) using the information-based metrics, (3) the calculated co-occurrence scores are rescaled according to the given rescaling matrix, which enables SIREN to distinguish between co-occurrences resulting from an activating or an inhibitory effect between two genes; and (4) determines the SIREN score by calculating the expected value of the rescaled co-occurrence probability scores. Mathematically speaking, the expected value of function \(f(X,Y)\) is defined as: \(E(f(X,Y)) = \sum\nolimits_{x,y} {p(x,y)f(x,y)}\). Therefore, SIREN score for two genes of X and Y is: \(\sum\nolimits_{x,y} {p(x,y)(W(x,y)CoS(x,y))}\), where CoS(x,y) is the co-occurrence score, W(x,y) refers to the rescaling matrix and p(x,y) is the co-occurrence probability when X = x and Y = y.

To optimize results, we compared four distinct scoring functions and four rescaling matrices as well as tested a range of different cut-off scores for SIREN to determine a reliable threshold.

SIREN scoring functions

To optimize the algorithm, we investigated four possible interaction scoring functions:


Based on the definitions of MI and PMI, the first scoring function was defined as \(S_{1} = \sum {W(x,y)} p(x,y)\log (p(x,y)/p(x)p(y))\), where W(x,y) is the rescaling matrix. If \(g(x,y) = W(x,y)\log (p(x,y)/p(x)p(y))\), then \(S_{1} = \sum {p(x,y)g(x,y)}\) or \(S_{1} = E(g(x,y))\) according to the Law of the Unconscious Statistician (LOTUS) [46]. The defined S 1 score is known as the weighted mutual information concept, as described in [47].


To give PMI a fixed upper bound, we normalize it to have a maximum value of 1 in the case of a perfect association. The advantage of normalized PMI over PMI is that the value of PMI is usually high for rare events. It is hoped that the normalized version will reduce the low frequency bias [25]. As stated above, \(PMI = \log (p(x,y)/p(x)p(y))\). In case of perfect association, we have \(p(x) = p(y) = p(x,y)\), consequently \(PMI = \log (p(x,y)/p(x)p(y)) = \log (p(x)/p(x)p(x)) = - \log (p(x))\).

Therefore, we can define Normalized PMI (NPMI) as
$$NPMI = \log (p(x,y)/p(x)p(y))/ - \log (p(x,y)).$$
We define the second scoring function \(S_{2} = E(W(x,y) \times NPMI)\).


The third scoring function is defined as \(S_{3} = \sum {p(x,y)[W(x,y)]}\). This score measures the expected value of the rescaling matrix W(x,y).


In a similar approach to the second scoring function, to give MI a fixed upper bound, we normalize MI to have a maximum value of 1 in the case of a perfect association [25]. As above, \(MI = \sum {p(x,y)\log (p(x,y)/p(x)p(y))}\). If \(p(x) = p(y) = p(x,y)\), then \(MI(x,y) = MI(x,x) = \sum {p(x,x)\log (p(x,x)/p(x)p(x))}\). Consequently, \(MI(x,x) = \sum {p(x,x)( - \log (p(x)))} = - \sum {p(x)\log (p(x))}\). Therefore \(Normalized\;MI(NMI) = {{\sum {p(x,y)} (\log (p(x,y)/p(x)p(y))} \mathord{\left/ {\vphantom {{\sum {p(x,y)} (\log (p(x,y)/p(x)p(y))} { - \sum {p(x,y)\log (p(x,y))} }}} \right. \kern-0pt} { - \sum {p(x,y)\log (p(x,y))} }}\).

We defined Normalized Rescaled MI (NRMI) as \(S_{4} = {{\sum {p(x,y)\left( {W(x,y)\left( {\log (p(x,y)/p(x)p(y))} \right)} \right)} } \mathord{\left/ {\vphantom {{\sum {p(x,y)\left( {W(x,y)\left( {\log (p(x,y)/p(x)p(y))} \right)} \right)} } { - \sum {p(x,y)} \left( {W(x,y)\left( {\log (p(x,y)} \right)} \right)}}} \right. \kern-0pt} { - \sum {p(x,y)} \left( {W(x,y)\left( {\log (p(x,y)} \right)} \right)}}\).

SIREN performance assessment

To measure SIREN performance, we defined two measures: true number (TNu) and false number (FNu). positive true positive (PTP) and negative true negative (NTN) is the number of interactions correctly signed positive and negative, respectively, whereas negative false positive (NFP) and positive false negative (PFN) is the number of interaction types that SIREN has assigned incorrectly positive and negative, respectively. TNu is the number of PTP plus the number of NTN, while FNu is the number of NFP plus the number of PFN. Accuracy, defined as TNu/(TNu + FNu), is the fraction of correctly signed interactions among all interactions signed by SIREN, while retrieval is the number of regulatory interactions signed by SIREN among all interactions (some of which are not signed). Performance of the algorithm is assessed using accuracy-retrieval curves.

Results and discussion

Determining the interaction types in GRNs

MI is used extensively for reconstructing GRNs because it has a low computational complexity and is able to capture nonlinear dependencies among variables [4850]. However, using MI has some disadvantages, including that it does not reveal the interaction type between two random variables. In the context of GRN reconstruction, this means that it does not identify whether a regulatory interaction is positive (activating) or negative (inhibiting) to overcome this challenge, we modified the conventional mutual information formula by adding a rescaling matrix. This rescaling matrix converts the MI function, which normally generates a non-negative score to a function that can have negative values. The resulting sign is used to predict the interaction type.

Using expression data, our new method can determine the interaction type between two interacting genes in a GRN. SIREN discriminates activating from inhibitory associations based on the premise that the effect of two interacting genes on each other will be reflected in their expression patterns across multiple cellular conditions. Similar expression profiles indicate a positive interaction and dissimilar profiles indicates a negative interaction.

Selecting the optimum interaction scoring function

To optimize SIREN, we defined four different scoring functions as well as four different rescaling matrices. To evaluate the performance of our algorithm in each case, we considered three different GRNs: an in silico constructed GRN, a prostate cancer GRN, and an E. coli high confidence GRN. The results, averaged across the four possible rescaling matrices, are presented in Figure 3.
Figure 3

Comparison of four possible scoring functions. Plots compare four different scoring functions on three different GRNs: a in silico constructed GRN with four possible scoring functions, b prostate cancer GRN with S1 and S2, and c E. coli high confidence GRN with S1 and S2.

In silico GRN

To evaluate the performance of SIREN algorithm, we selected nine (CXCR4, IGHM, TFAP2A, IGHV4-31, CLDN4, LOC100126583, CYAT1, TRPV6, FOXA1) and six (IFI27, RARRES1, GPX3, AGT, ACTA1, TTN) genes that were consistently up-or down- regulated during cancer progression, respectively (Figure 2). We then generated a clique network consisting of all possible interactions between these genes (105 interactions). This network consists of 51 positive (up–up or down–down) and 54 negative (up–down) interactions (Figure 4). Application of SIREN on the in silico network, as shown in Figure 3a, indicated that the scoring functions S1 and S2 have comparable performance while out-performing S3 and S4. Closer examination of the results showed that S3 is not sensitive enough to detect negative interactions because negative interactions are often derived from small magnitudes of the changes in expression levels. The logarithmic component of the S1 and S2 scoring functions magnifies these small differences in expression levels, but this is not present in S3. S4 had the lowest accuracy. Hence, we selected S1 and S2 scoring functions for further evaluations.
Figure 4

The in silico network. The constructed network clique is visualized with Cytoscape [51] (version 3.0.0). Red and green edges indicate positive and negative interaction types, respectively. Edge width shows the SIREN score for each edge.

Prostate cancer GRN

STRING is a functional interaction database that includes regulatory interactions. We extracted a functional interaction network based on genes that show alteration in their expression profile during prostate cancer progression, limited to regulatory interactions which we define as the prostate cancer GRN (see “Methods” for details). The extracted GRN was composed of 1,436 interactions among 526 genes (102 negative, 176 positive and 1,158 interactions with no sign). We then ran SIREN on this network and compared SIREN’s predicted interaction type to the known interaction type from STRING. As shown in Figure 3b, both S1 and S2 scoring functions had, again, comparable results on this GRN with about 70% accuracy.

E. coli GRN

We applied SIREN to an experimentally constructed GRN of E. coli containing 1,408 positive and 1,279 negative interactions. As shown in Figure 3c, both scoring functions S1 and S2 resulted in similar accuracies (56% maximum). In this test, the experimentally constructed GRN of E. coli and the gene expression data where from independent sources. The low performance of SIREN in this case is most probably because some regulatory circuits may not be reflected in the gene expression data. As an illustration, for two genes that have negative regulation on each other via negative feedback loop, we expect to observe that up-regulation of the regulator leads to the down-regulation of the regulated gene. However, if the expression level of regulator gene does not increase perceptibly, the expression patterns will not reflect the inhibitory effect. Thus, both genes will show similar expression patterns, and consequently, an activating interaction will be wrongly inferred. Considering this fact, our approach can reliably detect interaction types only for genes that show some level of alteration in the expression in the corresponding expression data set. Consistently, we found restricting the E. coli GRN to 10% most fluctuated genes (this sub-network was composed of 31 positive and 13 negative interactions) resulted in the precision of 68.18% (22 PTP and 8 NTN) for SIREN algorithm.

Scores obtained from the S1 scoring function have a wider range compared with the scores of S2 scoring functions in all three GRNs (Figure 5). Also, the S1 scoring function has a lower computational complexity. Considering these points, we selected S1 as the best scoring function for further investigations.
Figure 5

Comparing S1 and S2 scoring functions. Plots compare accuracy and retrieval of S1 and S2 scoring functions on three different GRNs: a in silico constructed GRN, b prostate cancer GRN, and c E. coli high confidence GRN. The x-axis represents threshold (0 to ±1) and the y-axis shows accuracy and retrieval percentage.

Selecting the optimum rescaling matrix

We have used a rescaling matrix to convert the MI function, which normally generates a non-negative score, to a function that can produce negative values. The resulting sign is used to predict either an activating (similar expression profiles) or inhibitory effect (different expression profiles) between genes. Using the B-spline approach, we smoothly discretized the expression profile of each gene into 10 bins. For each interacting pair, SIREN creates a two-dimensional grid with 100 cells. The distribution pattern of expression data in these 100 cells is used for predicting the interaction type. The interaction type can be inferred from this grid because the distribution pattern for genes with positively correlated expression patterns will be different from the distribution pattern of genes with a negative association. To discriminate the distribution patterns from each other, we have introduced the rescaling matrix (Figure 6). The design of four rescaling matrices evaluated for use in SIREN. For all the matrices, we initially assigned −1 to the two most negative bins and +1 to the most positive bins, on the diagonal of the matrix. We also arranged the matrices to each have equal number of positive and negative cells (42 positive, 42 negative, and 16 zero cells).
Figure 6

Four rescaling matrices. The design of four rescaling matrices evaluated for use in SIREN.

For matrix 1, for the other negative bins, we repeatedly subtracted 0.166667 (one divided by six negative levels) as we moved towards the border between positive and negative. The positive cells were treated similarly. The positive cells in matrix 2 are the same as in matrix 1; however, to improve detection of negative interactions, and to compensate for the +10 discrepancy in overall weight arising from the matrix’s diagonal, we increased the weight on the negative cells such that the overall weight in the matrix was equal to zero. For matrix 3, we simply assigned −1 and +1 to each non-zero cell. The negative cells in matrix 4 are the same with matrix 1; for the positive cells, we used a multiplicative scaling factor rather than an additive one.

To select the best performing matrix from these four matrices, we examined the performance of each of them on the three selected benchmark GRNs (Figure 7). Our results indicate that SIREN is robust to the selected rescaling matrix, especially for the experimentally derived GRNs. However, the M3 rescaling matrix (Matrix 3) (Figure 6) performs better with the in silico network (Figure 7). This may be caused by the higher ratio of negative interactions in the in silico network (51.43%). Considering results obtained from this step, we chose M3 as the optimum rescaling matrix.
Figure 7

Evaluation of four rescaling matrices. Three plots show the result of applying SIREN using scoring function S1 with each rescaling matrix on three GRNs. a The M3 rescaling matrix performs best with the in silico network. b, c SIREN is robust to choice of rescaling matrix for experimentally derived GRNs.

Selecting the best threshold

To select the best threshold on the resulting SIREN score, we applied it to the E. coli, prostate and in silico benchmarks, using the S1 scoring function and the M3 rescaling matrix. We tested a range of different cut-off scores (20 different thresholds between 0 and 1) for SIREN to determine a reliable threshold for various networks. The results showed that when the cut-off threshold is greater than +0.158 or smaller than −0.158, SIREN does not detect any interaction type in random data (generated by 106 times of shuffling gene expression data) (Figure 8), while many interactions are predicted to be signed in the benchmark GRNs.
Figure 8

Selecting the best threshold for SIREN. The relationship between accuracy and retrieval and the best threshold with highest accuracy and fair retrieval. A accuracy, R retrieval; E E. coli, P prostate, S in silico. As the figure shows in ±0.158, no interaction type was detected randomly by SIREN where the color spectrums were changed to be completely white in accuracy and retrieval of all three random networks.

Figure 9 demonstrates the application of SIREN (with optimized parameters) on two example interactions, one activating and one inhibitory. As mentioned earlier, SIREN detects the interaction type in four steps: (1) discretizing the expression profile of each gene into 10 bins; (2) calculating the co-occurrence probability for each combination of bins using the PMI metric; (3) defining an activating or inhibitory relationship for each combination of bins by aid of a rescaling matrix; and (4) calculating a final score by integrating the calculated values for each combination of bins. For example, with two genes with a known activating relationship from STRING (JUN and ATF3) [52, 53], bins defined as activating have non-zero values while bins defined as inhibitory have mostly zero values (Figure 9a). This situation is reversed for two genes with a known inhibitory relationship (ZEB1 and CDH1) [54] (Figure 9b).
Figure 9

Deciphering interaction type from co-expression patterns. a, b The two-dimensional grids are constructed for two selected gene pairs with known activating or inhibitory effect on each other. The color density for each cell in the grid represents the computed PMI for that cell multiplied in the occurrence probability of the cell and corresponding rescaling value (determined based on the rescaling matrix). The PMI and occurrence probability is calculated based on the associated transcriptome data. Red indicates positive score and blue represents negative score (defined based on the M3 rescaling matrix). SIREN score is determined by summing up the calculated values for each combination of bins. a For two example genes with known activating relationships (JUN and ATF3), cells defined as activating have non-zero values and cells defined as inhibitory relationship, have zero values. b This situation is reversed for two genes with known inhibitory relationship (ZEB1 and CDH1).

Deficiency in current knowledge about interaction types

PCC has been widely used to decipher the interaction type based on transcriptome data [55, 56]. We compared SIREN with PCC by applying both to all three GRNs. This comparison revealed that their overall results are similar, suggesting that most regulatory associations in the considered GRNs have a linear or monotonic nature (Figure 10). However, the results of PCC and SIREN are inconsistent for some interactions. For example two genes with an activating relationship from STRING (EGR1 and FGF2) [57] are determined to have an inhibition relationship using PCC while SIREN inferred a positive association. On the other hand MICA and IL10 show an inhibition association [58] by STRING and SIREN; while they have positive association based on PCC. Ultimately, SIREN shows superior performance in all but the in silico network case (Figure 11), indicating that consideration of non-linear relationships in the gene expression data is useful.
Figure 10

Close relationship between Pearson correlation coefficient and SIREN. Three figures illustrate the relationship between PCC and SIREN results for three GRNs: a in silico GRN, b prostate cancer GRN, and c E. coli high confidence GRN.
Figure 11

SIREN versus Pearson correlation coefficient. The relationship between accuracy and retrieval of SIREN was compared with PCC on three GRNs.

Our SIREN predictions on the prostate cancer GRN included 454 interactions for which no regulatory type existed in STRING (Additional file 3). A literature search on a sample of these newly signed GRN supports the reliability of our results. For example, we predict a positive association between EGR1 and ATF3 genes, which is in line with previous studies that have shown these two genes associated with each other and ATF3 is a target of EGR1 that induces an up-regulation of ATF3 [59].We also found a negative association between FASN and CAV-1 which is consistent with previous reports that showed FASN interact with CAV-1, a marker for metastasis state of prostate cancer, and inactivation of CAV-1 mediates by FASN [52].


At present, there is no information theory-based framework to detect regulatory interaction types in gene regulatory networks. In this work, we tried to fill this gap by exploiting the notion that the effect two interacting genes have on each other can be observed in their expression patterns. This idea allowed us to develop an information theory-based solution, SIREN, to identify interaction types using gene expression data. SIREN increases the amount of information available for GRNs compared to standard GRN inference algorithms. SIREN runs reasonably fast; computing the 2,687 interactions among 1,419 genes took 6 min on an Intel Core i5 system with 4 GB of RAM; hence it is usable with large biological networks. Additionally, we have shown the method is applicable to prokaryotic and eukaryotic GRNs.




accuracy-retrieval curves


false number


gene regulatory networks


Law of the Unconscious Statistician


many microbe microarray database


mutual information


number of bins


negative false positives


normalized MI


normalized rescaled MI


negative true negatives


Pearson coefficient correlation


positive false negatives


point-wise mutual information


positive true positives


signing of regulatory networks


spline order


true number


Authors’ contributions

PK, VHG and LP conceived of the study. PK, VHG, BL, MS, BG and GDB designed the experiments. PK and VHG devised the algorithm and PK performed analysis. PK, VHG, BL and GDB wrote the paper. All authors read and approved the final manuscript.


This work was supported by NRNB (U.S. National Institutes of Health, National Center for Research Resources Grant Number P41 GM103504). PK is supported by the School of Biological Sciences of Institute for Research in Fundamental Sciences (IPM).VHG is supported by CIHR Systems Biology Fellowship. The authors would like to warmly thank Dr. Scott Zuyderduyn in the Bader Lab for his critical comments.

Compliance with ethical guidelines

Competing interests The authors declare that they have no competing interests.

Open AccessThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (, which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The Creative Commons Public Domain Dedication waiver ( applies to the data made available in this article, unless otherwise stated.

Authors’ Affiliations

School of Biological Sciences, Institute for Research in Fundamental Sciences (IPM)
The Donnelly Centre, University of Toronto
Institute of Parasitology, McGill University
Department of Biotechnology, College of Science, University of Tehran
Department of Computer Science, University of Toronto
National Institute of Genetic Engineering and Biotechnology
Department of Bioinformatics, Institute of Biochemistry and Biophysics (IBB), University of Tehran


  1. Cornuéjols A, Miclet L (2002) Apprentissage artificiel: concepts et algorithms. Eyrolles
  2. Webb A (2002) Statistical pattern recognition. Wiley, New YorkView ArticleGoogle Scholar
  3. Mitchell T (1997) Machine learning. McGraw Hill, New YorkGoogle Scholar
  4. Jaynes ET (2003) Probability theory: the logic of science. Cambridge University Press, CambridgeView ArticleGoogle Scholar
  5. Alon U (2006) An introduction to systems biology. Chapman and Hall, London
  6. Basso K, Margolin AA, Stolovitzky G, Klein U, Dalla-Favera R, Califano A (2005) Reverse engineering of regulatory networks in human B cells. Nat Genet 37:382–390PubMedView ArticleGoogle Scholar
  7. van de Vijver MJ, He YD, van’t Veer LJ, Dai H, Hart AA, Voskuil DW et al (2002) A gene-expression signature as a predictor of survival in breast cancer. N Engl J Med 347:1999–2009
  8. Wang Y, Klijn JG, Zhang Y, Sieuwerts AM, Look MP, Yang F et al (2005) Gene-expression profiles to predict distant metastasis of lymph-node-negative primary breast cancer. Lancet 365:671–679
  9. Gardner TS, Faith JJ (2010) Reverse-engineering transcription control networks. Phys Life Rev 2:65–88View ArticleGoogle Scholar
  10. Schulz MH, Devanny WE, Gitter A, Zhong S, Ernst J, Bar-Joseph Z (2012) DREM 2.0: improved reconstruction of dynamic regulatory networks from time-series expression data. BMC Syst Biol 6:104PubMed CentralPubMedView ArticleGoogle Scholar
  11. Awad S, Chen J (2014) Inferring transcription factor collaborations in gene regulatory networks. BMC Syst Biol 8(Suppl 1):S1PubMed CentralPubMedView ArticleGoogle Scholar
  12. Awad S, Panchy N, Ng SK, Chen J (2012) Inferring the regulatory interaction models of transcription factors in transcriptional regulatory networks. J Bioinform Comput Biol 10:1250012PubMedView ArticleGoogle Scholar
  13. Bar-Joseph Z, Gitter A, Simon I (2012) Studying and modelling dynamic biological processes using time-series gene expression data. Nat Rev Genet 13:552–564PubMedView ArticleGoogle Scholar
  14. Yeang CH, Jaakkola T (2006) Modeling the combinatorial functions of multiple transcription factors. J Comput Biol 13:463–480PubMedView ArticleGoogle Scholar
  15. Mason MJ, Fan G, Plath K, Zhou Q, Horvath S (2009) Signed weighted gene co-expression network analysis of transcriptional regulation in murine embryonic stem cells. BMC Genom 10:327View ArticleGoogle Scholar
  16. Guziolowski C, Kittas A, Dittmann F, Grabe N (2012) Automatic generation of causal networks linking growth factor stimuli to functional cell state changes. FEBS J 279:3462–3474PubMedView ArticleGoogle Scholar
  17. Song L, Langfelder P, Horvath S (2012) Comparison of co-expression measures: mutual information, correlation, and model based indices. BMC Bioinformatics 13:328PubMed CentralPubMedView ArticleGoogle Scholar
  18. Margolin AA, Nemenman I, Basso K, Wiggins C, Stolovitzky G, Dalla Favera R et al (2006) ARACNE: an algorithm for the reconstruction of gene regulatory networks in a mammalian cellular context. BMC Bioinformatics 7(Suppl 1):S7PubMed CentralPubMedView ArticleGoogle Scholar
  19. Butte AJ, Kohane IS (2000) Mutual information relevance networks: functional genomic clustering using pairwise entropy measurements. Pac Symp Biocomput 2000:418–429
  20. Faith JJ, Hayete B, Thaden JT, Mogno I, Wierzbowski J, Cottarel G et al (2007) Large-scale mapping and validation of Escherichia coli transcriptional regulation from a compendium of expression profiles. PLoS Biol 5:e8PubMed CentralPubMedView ArticleGoogle Scholar
  21. Rivaz H, Collins DL (2012) Self-similarity weighted mutual information: a new nonrigid image registration metric. Med Image Comput Comput Assist Interv MICCAI Int Conf Med Image Comput Comput Assist Interv 15:91–98Google Scholar
  22. Rivaz H, Karimaghaloo Z, Collins DL (2014) Self-similarity weighted mutual information: a new nonrigid image registration metric. Med Image Anal 18:343–358PubMedView ArticleGoogle Scholar
  23. Park SB, Rhee FC, Monroe JI, Sohn JW (2010) Spatially weighted mutual information image registration for image guided radiation therapy. Med Phys 37:4590–4601PubMedView ArticleGoogle Scholar
  24. Schaffernicht E, Gross H-M (2011) Weighted mutual information for feature selection. In: Proceedings 21 international conference on artificial neural networks (ICANN 2011); Espoo, Finland, LNCS 6792. Springer, pp 181–188
  25. Bouma G (2009) Normalized pointwise mutual information in collocation extraction. In: Proceedings of the Biennial GSCL Conference 2009. Gunter Narr Verlag, Tübingen, pp 31–40Google Scholar
  26. Moon YI, Rajagopalan B, Lall U (1995) Estimation of mutual information using kernel density estimators. Phys Rev E 52:2318–2321View ArticleGoogle Scholar
  27. Daub CO, Steuer R, Selbig J, Kloska S (2004) Estimating mutual information using B-spline functions–an improved similarity measure for analysing gene expression data. BMC Bioinformatics 5:118PubMed CentralPubMedView ArticleGoogle Scholar
  28. Unser M, Aldroubi A, Eden M (1993) B-Spline signal-processing .2. Efficient design and applications. IEEE Trans Signal Process 41:834–848
  29. Deboor C (1978) A practical guide to splines. Springer-Verlag, New YorkView ArticleGoogle Scholar
  30. Li H, Sun Y, Zhan M (2007) Analysis of gene coexpression by B-spline based CoD estimation. EURASIP J Bioinform Syst Biol 2007:49478
  31. Bolboacă S-D, Jäntschi L (2006) Pearson versus Spearman, Kendall’s Tau correlation analysis on structure-activity relationships of biologic active compounds. Leonardo J Sci 2006:179–200
  32. Numata J, Ebenhoh O, Knapp EW (2008) Measuring correlations in metabolomic networks with mutual information. Genome Inform Int Conf Genome Inform 20:112–122View ArticleGoogle Scholar
  33. Eisen MB, Spellman PT, Brown PO, Botstein D (1998) Cluster analysis and display of genome-wide expression patterns. Proc Natl Acad Sci USA 95:14863–14868PubMed CentralPubMedView ArticleGoogle Scholar
  34. Zhou XH, Kao MCJ, Wong WH (2002) Transitive functional annotation by shortest-path analysis of gene expression data. P Natl Acad Sci USA 99:12783–12788View ArticleGoogle Scholar
  35. Stuart JM, Segal E, Koller D, Kim SK (2003) A gene-coexpression network for global discovery of conserved genetic modules. Science 302:249–255PubMedView ArticleGoogle Scholar
  36. Zhang B, Horvath S (2005) A general framework for weighted gene co-expression network analysis. Stat Appl Genet Mol Biol 4:17Google Scholar
  37. Langfelder P, Horvath S (2008) WGCNA: an R package for weighted correlation network analysis. BMC Bioinformatics 9:559PubMed CentralPubMedView ArticleGoogle Scholar
  38. Butte AJ, Tamayo P, Slonim D, Golub TR, Kohane IS (2000) Discovering functional relationships between RNA expression and chemotherapeutic susceptibility using relevance networks. Proc Natl Acad Sci USA 97:12182–12186PubMed CentralPubMedView ArticleGoogle Scholar
  39. Meyer PE, Lafitte F, Bontempi G (2008) minet: A R/bioconductor package for inferring large transcriptional networks using mutual information. BMC Bioinformatics 9:461PubMed CentralPubMedView ArticleGoogle Scholar
  40. Priness I, Maimon O, Ben-Gal I (2007) Evaluation of gene-expression clustering via mutual information distance measure. BMC Bioinformatics 8:111PubMed CentralPubMedView ArticleGoogle Scholar
  41. Cadeiras M, von Bayern M, Sinha A, Shahzad K, Latif F, Lim WK et al (2011) Drawing networks of rejection—a systems biological approach to the identification of candidate genes in heart transplantation. J Cell Mol Med 15:949–956PubMed CentralPubMedView ArticleGoogle Scholar
  42. Snel B, Lehmann G, Bork P, Huynen MA (2000) STRING: a web-server to retrieve and display the repeatedly occurring neighbourhood of a gene. Nucleic Acids Res 28:3442–3444PubMed CentralPubMedView ArticleGoogle Scholar
  43. Chandran UR, Ma C, Dhir R, Bisceglia M, Lyons-Weiler M, Liang W et al (2007) Gene expression profiles of prostate cancer reveal involvement of multiple molecular pathways in the metastatic process. BMC Cancer 7:64PubMed CentralPubMedView ArticleGoogle Scholar
  44. Gama-Castro S, Jimenez-Jacinto V, Peralta-Gil M, Santos-Zavaleta A, Penaloza-Spinola MI, Contreras-Moreira B et al (2008) RegulonDB (version 6.0): gene regulation model of Escherichia coli K-12 beyond transcription, active (experimental) annotated promoters and Textpresso navigation. Nucleic Acids Res 36:D120–D124PubMed CentralPubMedView ArticleGoogle Scholar
  45. Faith JJ, Driscoll ME, Fusaro VA, Cosgrove EJ, Hayete B, Juhn FS et al (2008) Many Microbe Microarrays Database: uniformly normalized Affymetrix compendia with structured experimental metadata. Nucleic Acids Res 36:D866–D870PubMed CentralPubMedView ArticleGoogle Scholar
  46. Tsuei DJ, Hsu HC, Lee PH, Jeng YM, Pu YS, Chen CN et al (2004) RBMY, a male germ cell-specific RNA-binding protein, activated in human liver cancers and transforms rodent fibroblasts. Oncogene 23:5815–5822PubMedView ArticleGoogle Scholar
  47. Guiasu S (1977) Information theory with applications. McGraw-Hill Inc., NewYorkGoogle Scholar
  48. Zhang X, Zhao XM, He K, Lu L, Cao Y, Liu J et al (2012) Inferring gene regulatory networks from gene expression data by PC-algorithm based on conditional mutual information. Bioinformatics 28:98–104PubMedView ArticleGoogle Scholar
  49. Liang KC, Wang X (2008) Gene regulatory network reconstruction using conditional mutual information. EURASIP J Bioinform Syst Biol 2008:253894
  50. Kim DC, Wang X, Yang CR, Gao J (2010) Learning biological network using mutual information and conditional independence. BMC Bioinformatics 11(Suppl 3):S9PubMed CentralPubMedView ArticleGoogle Scholar
  51. Shannon P, Markiel A, Ozier O, Baliga NS, Wang JT, Ramage D et al (2003) Cytoscape: a software environment for integrated models of biomolecular interaction networks. Genome Res 13:2498–2504PubMed CentralPubMedView ArticleGoogle Scholar
  52. Perinchery G, Sasaki M, Angan A, Kumar V, Carroll P, Dahiya R (2000) Deletion of Y-chromosome specific genes in human prostate cancer. J Urol 163:1339–1342PubMedView ArticleGoogle Scholar
  53. Dasari VK, Goharderakhshan RZ, Perinchery G, Li LC, Tanaka Y, Alonzo J et al (2001) Expression analysis of Y chromosome genes in human prostate cancer. J Urol 165:1335–1341PubMedView ArticleGoogle Scholar
  54. Kurasawa Y, Kozaki K, Pimkhaokham A, Muramatsu T, Ono H, Ishihara T et al (2012) Stabilization of phenotypic plasticity through mesenchymal-specific DNA hypermethylation in cancer cells. Oncogene 31:1963–1974PubMedView ArticleGoogle Scholar
  55. Lee HK, Hsu AK, Sajdak J, Qin J, Pavlidis P (2004) Coexpression analysis of human genes across many microarray data sets. Genome Res 14:1085–1094PubMed CentralPubMedView ArticleGoogle Scholar
  56. Bhardwaj N, Lu H (2005) Correlation between gene expression profiles and protein-protein interactions within and across genomes. Bioinformatics 21:2730–2738PubMedView ArticleGoogle Scholar
  57. Iyoda T, Zhang F, Sun L, Hao F, Schmitz-Peiffer C, Xu X et al (2012) Lysophosphatidic acid induces early growth response-1 (Egr-1) protein expression via protein kinase Cdelta-regulated extracellular signal-regulated kinase (ERK) and c-Jun N-terminal kinase (JNK) activation in vascular smooth muscle cells. J Biol Chem 287:22635–22642PubMed CentralPubMedView ArticleGoogle Scholar
  58. Chattopadhyay K (2011) A comprehensive review on host genetic susceptibility to human papillomavirus infection and progression to cervical cancer. Indian J Human Genetics 17:132–144View ArticleGoogle Scholar
  59. Lau YF, Zhang J (2000) Expression analysis of thirty one Y chromosome genes in human prostate cancer. Mol Carcinog 27:308–321PubMedView ArticleGoogle Scholar


© Khosravi et al. 2015