Skip to main content
Scientific Reports logoLink to Scientific Reports
. 2015 Oct 16;5:15258. doi: 10.1038/srep15258

Quantitative assessment of gene expression network module-validation methods

Bing Li 1,2, Yingying Zhang 1, Yanan Yu 1, Pengqian Wang 1, Yongcheng Wang 3, Zhong Wang 1,a, Yongyan Wang 1,b
PMCID: PMC4607977  PMID: 26470848

Abstract

Validation of pluripotent modules in diverse networks holds enormous potential for systems biology and network pharmacology. An arising challenge is how to assess the accuracy of discovering all potential modules from multi-omic networks and validating their architectural characteristics based on innovative computational methods beyond function enrichment and biological validation. To display the framework progress in this domain, we systematically divided the existing Computational Validation Approaches based on Modular Architecture (CVAMA) into topology-based approaches (TBA) and statistics-based approaches (SBA). We compared the available module validation methods based on 11 gene expression datasets, and partially consistent results in the form of homogeneous models were obtained with each individual approach, whereas discrepant contradictory results were found between TBA and SBA. The TBA of the Zsummary value had a higher Validation Success Ratio (VSR) (51%) and a higher Fluctuation Ratio (FR) (80.92%), whereas the SBA of the approximately unbiased (AU) p-value had a lower VSR (12.3%) and a lower FR (45.84%). The Gray area simulated study revealed a consistent result for these two models and indicated a lower Variation Ratio (VR) (8.10%) of TBA at 6 simulated levels. Despite facing many novel challenges and evidence limitations, CVAMA may offer novel insights into modular networks.


Modularity is a common characteristic of omics-based biological networks1,2,3. Module-based analyses that investigate or deconstruct omics-based biological networks have become a hot topic in recent years4,5. Various types of algorithms have been proposed to identify modules (also known as communities, clusters, and subnetworks), including network clustering6,7, heuristic search8,9, seed extension10, topology network11,12, and matrix decomposition13,14. However, in contrast to the large number of module detection methods4, there are few methods for module validation and evaluation. How to evaluate the accuracy and validity of modules has become a new challenge for researchers. Most previous studies used function enrichment methods to evaluate modules based on functional annotations, such as GO, MIPS, and KEGG15,16,17,18,19,20,21,22,23,24. However, some modules may be enriched with too many functions, whereas others may be enriched without any functions, and the background annotation database itself is constantly being updated. Other studies used molecular biological experimental techniques to verify the co-expression, transcription regulation or other interaction relationships among members of a given module25,26,27,28,29,30. However, this method is only suitable for small modules that consist of only a few nodes, and it is nearly impossible to perform this method for a larger module. Thus, in the era of Big Data and omics revolution, an arising challenge is to explore rational strategies to validate biological network modules.

Several published studies have employed Computational Validation Approaches based on Modular Architecture (CVAMA) to evaluate modules’ authenticity, reproducibility, and significance or to identify phenotype-related functional modules31,32,33,34,35. These approaches are not limited by module size and supporting databases. With an increasing number of omics technologies and module analysis methods, CVAMA may become the new focus. In this paper, we summarized the available CVAMA methods, which were divided into topology-based approaches (TBA) and statistics-based approaches (SBA). One representative method of each was selected to validate modules obtained from genomic datasets, and comparative analyses were performed to illuminate the feasibility and challenges in CVAMA.

Results

Topology-based approaches (TBA) for module validation

A module may have several topological features, such as modularity2, connectivity36, density36,37, clustering coefficient37, degree38, and edge betweenness39. Module detection methods may focus on one or a few topological criteria, and it is also essential to determine whether the identified modules have a modular structure. Therefore, we may use a single or composite topological index to evaluate whether a module is valid (Table 1). Any single topological index used to validate a module should be independent of the methods used to identify the module, such as the network perplexity index of Entropy40,41. The entropy increases when the data are more uniformly distributed; therefore, a good quality module is expected to have a low entropy42,43. Topological indexes, including intra-modular connectivity44 and NB value26, have been applied to evaluate whether the intra-modular structure is different from other parts of the whole network. Other indexes, such as compactness45 and weak community46, can be used to select good clusters from integrated clustering results. Because a single topological index is not likely to provide a global evaluation of the modular structure, an alternative choice is to combine multiple topological indexes into an integrated measure to assess a module’s validity. Both internal and external indexes, such as density, connectivity, and tabulation-based module preservation statistics, can be integrated to validate the existence of a module35,47. Based on a global view of the modular structure, it may be advantageous to aggregate multiple module evaluation statistics into summary preservation statistics. In our study, we validated five preserved modules whose Zsummary value (an integrated index) was greater than 2.

Table 1. Topology- and statistics-based methods for module validation.

No. Type Index Equation Criteria Application Test data Ref.
Topological validation
 1 Integrated index Zsummary Inline graphic ≥10, strongly preserved; 2~10, moderately preserved; ≤2, no preservation Composite preservation statistics to validate whether a module is significantly preserved in another network. Apply to correlation networks (e.g., co-expression networks) yes 35,40,41
 2 ZsummaryADJ Inline graphic ≥10, strongly preserved; 2~10, moderately preserved; ≤2, no preservation Same as above. Apply to general networks (e.g., adjacency matrix networks) yes 35
 3 medianRank Inline graphic The lower the better Same as above. yes 35
 4 Single index Entropy Inline graphic The smaller the better Access the quality of identified modules. A good quality module is expected to have a low entropy. no 42,43
 5 Mpres Mpres = cor(kl,km) The closer to 1, the better Describe the preservation of intra-modular connectivity across two networks. A p-value can be assigned to evaluate the reproducibility of modules. yes 44,45
 6 NB value Inline graphic NB ≥ 0.5 A ratio of edges within a module and the total number of edges between modules is used to select modules with high intra-modular connectivity. no 26
 7 CS (S) Inline graphic CS (S) > 0, the higher the better Describe the compactness and neighboring conditions of a cluster. Apply to select good clusters from integrated clustering results no 46
 8 LS (S) Inline graphic The higher the better Judge the quality of a cluster S in a graph G and help to select good clusters from integrated clustering results. no 47
  9 Modularity Inline graphic 0.3 ≤ Q ≤ 0.7 Evaluate the level of modular structure and the best split of a network into modules. no 2,39,102
Statistical validation
 1 Integer linear programming C · (X1, X2, …, Xk) Inline graphic C ≤ 0, the smaller the better A classifier and integer linear programming model to select modules based on the activity of the module in case and control samples. yes 49,50
 2 Bootstrap resampling P-value NULL P ≤ 0.05 P-value is derived from multiscale bootstrap resampling to assess the uncertainty of clustering analysis and search for significant modules. no 25,33
 3 Consensus score Inline graphic ≥ρ, the higher the better A jackknife resampling procedure is used to assess the accuracy and robustness of functional modules resulting in an ensemble of optimal modules. no 56
 4 Permutation test Combinatorial p-value NULL Combinatorial criteria: (1) P(Zm) < 0.05; (2) PGL, PnSNPs, Ptopo < 0.05; (3) Pemp < 0.05 Additional criteria: P(Zm(eval)) and/or Pemp(eval) < 0.05 Significance and permutation tests are used to calculate the P value of module scores. Appropriate for GWAS data; multiple GWAS datasets are needed when using additional criteria. yes 52
 5 coClustering (q) Inline graphic ≥95% A cross-tabulation-based statistic for determining whether modules in the reference dataset are preserved in a test dataset, a permutation test to determine the p value. yes 45
 6 Modular compatibility Compatibility Score (Cp) Inline graphic The closer to 1, the better An indication of agreement or overlap between two sets of modules to measure the network modular compatibility between two networks. yes 53
 7 Matching p-value NULL P < 0.05 Modified hypergeometric test-derived p-values with Bonferroni correction to measure modules’ conservation between any two species or networks. yes 54
 8 IGP Inline graphic The closer to 1, the better Defined to validate an individual cluster’s reproducibility and prediction accuracy. yes 55

The topology-based methods (TBA) and statistics-based methods (SBA) for module validation. The columns reports the types, index names, equations, criteria (the cut-off value to evaluate modules), applicable conditions, test data (whether this method requires an additional test network to validate a module) and references.

Statistics-based approaches (SBA) for module validation

In addition to topological criteria, a module should also be statistically significant, which means that the modular architecture distribution ought to be highly unlikely to be obtained by chance in a randomized network. Moreover, exploring the relationship between modules and various phenotypes or identifying consistent modules may also require significance testing31,33,48,49. For this reason, SBA is an important process to assess a module’s stability, phenotypic correlation or significance of consistency (Table 1). For responsive modules or module biomarker identification50,51,52, binary or mixed integer linear programming models can be used to validate the causal or dependent relations between network modules and biological phenotypes34,53,54. In phylogeny, resampling approaches are defined as a confidence measure for splits in a phylogenetic tree and are used to calculate consensus trees55, which can also be used to assess the robustness of modules in network analysis25,56. A permutation test with a p value calculated by empirically estimating the null distribution can be adopted to determine whether the module composition is higher than expected by chance or associated with the disease being investigated57,58. Moreover, given two or more networks, comparative network analysis is often used to identify modules across networks or species, and these modules are defined as consensus or conserved modules31,59. Moreover, a module’s “reproducibility” can also be assessed, i.e., to what extent a module obtained from one network is compatible with modules in another network46,55,60,61,62. In our study, by using hierarchical clustering, we identified 66 statistically significant modules based on approximately unbiased (AU) p-values.

Module identification based simply on topological criteria or statistical significance may not discover certain types of biologically meaningful modules63. Because disparate results can be obtained from the same network with different algorithms, functional validation can be used to evaluate the performance of different module identification methods64. Although it is not our focus in this study, we summarize and list functional module validation methods reported in the published literature (Supplementary Table 1). Typically, the most widely used functional validation method is functional homogeneity evaluation65,66, with indexes such as functional enriched p value7,45,67 and R score7,68. Furthermore, the index of quantitative score based on function enrichment analysis may be applied to assess a module’s confidence level21 or disease relationship69. Moreover, known protein complex matching can also provide functional evidence for modules, and the commonly used indexes include the overlapping score (OS)7,70 and F-measure67,71. Other measurements, such as the positive predictive value (PPV), accuracy, and separation, can also be used72. For small modules, the experimental techniques of molecular biology, such as real-time quantitative PCR (qPCR), western blotting, and siRNA knock-down, may be applied to validate the co-expression, co-regulation or other interaction relations among the genes or proteins within a module25,26,27,28.

Homogeneity of different models of TBA on the same dataset

Both Zsummary and medianRank are integrated topological indexes of module preservation. We applied these two models to evaluate modules identified from the same dataset (GSE24001), which was derived from 30 newly diagnosed infant acute lymphoblastic leukemia samples. Modules were identified by the Weighted Gene Co-Expression Network Analysis (WGCNA) R package73, setting 3 as the minimum module gene number. Each module was detected based on a hierarchical cluster tree and was labeled by colors (Fig. 1A). The validation results are shown in Fig. 1B,C. Five preserved modules (Zsummary ≥ 2) all had a relatively low medianRank values, and the most strongly preserved module (Zsummary = 13) had the lowest medianRank value. Similarly, the two modules that had the highest medianRank value (medianRank = 10) were both unpreserved.

Figure 1.

Figure 1

(A) Hierarchical cluster tree showing coexpression modules identified by WGCNA. Each leaf in the tree represents one gene. The major tree branches constitute 9 modules labeled by different colors. (B) The medianRank preservation statistics (y-axis) of the modules. Each point represents a module, labeled by color and names. Low numbers on the y-axis indicate high preservation. (C) The Zsummary preservation statistics (y-axis) of the modules. The modules are labeled as in panel (B) The dashed blue and green lines indicate the thresholds. A Zsummary value over 2 represents a moderately preserved module, and a value over 10 provides strong evidence of module preservation. (D) Scatter plots showing the correlation between the Zsummary (y-axis) and module size (x-axis). (E) The cluster dendrogram with approximately unbiased (AU) P-values. The AU p-values are displayed in red, and clusters with an AU p-value lower than 0.05 are highlighted by rectangles. The calculations and the drawn figure were performed using the pvclust R package.

Example modules validated by two models of TBA

Among the 5 preserved modules, the turquoise module, which had 250 nodes and 30,833 edges, was most strongly preserved (Zsummary = 13), having the lowest medianRank value (medianRank = 2) (Fig. 2A). The preserved yellow module, which was composed of 64 nodes and 1,970 edges, had a low medianRank value (medianRank = 5) (Fig. 2B). Among the 4 unpreserved modules, the red module, consisting of 23 nodes and 253 edges (Fig. 2C), and the magenta module, consisting of 5 nodes and 9 edges (Fig. 2D), had the highest medianRank values (both medianRank = 10).

Figure 2. The preserved and unpreserved modules.

Figure 2

Each node is a gene, and each edge is the co-expression relationship. (A) The turquoise module. (B) The yellow module. (C) The red module. (D) The magenta module.

Variability of TBA (Zsummary) and SBA (AU P-value) results on the same dataset

Based on the same dataset (GSE24001), we compared the validation results of TBA and SBA, choosing Zsummary and AU p-value as the representative methods for each approach. For Zsummary, 5 preserved modules were validated from 9 modules. The Zsummary value was dependent on the module size, which was consistent with previous studies35 (Fig. 1D). The AU p-value used to access the modular architecture distributional probability was computed to search for significant modules (clusters). As shown in Fig. 1E, 66 modules with 3 or more genes and an AU p-value larger than 0.95 are highlighted by rectangles, which are strongly supported by the gene expression data. Different numbers of detected modules and valid modules were obtained through the two methods.

Multiple comparisons of Zsummary and medianRank on 10 datasets

For the same modules identified by WCGNA, we applied the integrated topological indexes Zsummary and medianRank to 10 datasets to further compare the results of module preservation evaluation. The average size of modules obtained from the 10 datasets is shown in Fig. 3A. Because medianRank was a relative preservation index without a cutoff value, we compared the top 10 ranked modules validated by Zsummary and medianRank (Fig. 3B). We failed to obtain a valid Zsummary value in two datasets (GSE6448, GSE29230) when the minimum module size was set at 3. For the other 8 datasets, overlapping preserved modules validated by Zsummary and medianRank were found in 7 datasets, and consistent ranked modules were observed in 6 datasets, demonstrating the consistency of the two indexes. However, no overlapping modules in the top 10 preserved modules were found in one dataset (GSE4882).

Figure 3. The comparison of TBA (Zsummary and medianRank) and SBA (AU p-value) on 10 datasets.

Figure 3

(A) A mean module size of 10 datasets. The y-axis is the mean module size (nodes), and the x-axis is each dataset number. (B) Comparison of the top 10 preserved modules validated by Zsummary and medianRank. The red spots represent the number of consistently ranked modules. The green spots represent the number of overlapping modules. The blue spots represent the number of non-overlapping modules. (C) The effect of changing the minimum module size setting from 4 to 10 on two datasets. The y-axis is the percentage of preserved modules, and the x-axis is the different cutoff value settings. (D) The percentage of preserved modules validated by Zsummary on 10 datasets. (E) The percentage of significant modules validated by AU P-value on 10 datasets. In (D,E) the blue bars indicate the number of all the modules detected, and the red bars indicate the number of preserved or significant modules. (F) The VSR and FR of Zsummary and AU P-value on 10 datasets. The red bars represent Zsummary, and the blue bars represent the AU P-value.

Zsummary analysis was impeded by small module size

Because we failed to obtain a valid Zsummary value in two datasets (GSE6448, GSE29230) with a minimum module size of 3, we changed this cutoff value from 4 to 10. Then, valid Zsummary values were acquired in both datasets, and the percent of preserved modules was stable (Fig. 3C) due to the too small density or connectivity, leading to invalid Zsummary values when the minimum module size was set at 3.

Comparison of TBA (Zsummary) and SBA (AU P-value) results for 10 datasets

As mentioned above, Zsummary is a TBA index and AU P-value is an SBA index. Based on 10 datasets, we compared the performance of these two types of index. In this application, modules with 3 or more genes were considered as valid modules. The proportions of valid (preserved or significant) modules obtained by these two indexes from 10 datasets are shown in Fig. 3D,E. For different methods and datasets, both the module number and the proportion of valid modules varied greatly. Overall, the Validation Success Ratios (VSR) of Zsummary and AU P-value were 51% and 12.3%, respectively (Fig. 3F). This indicated that Zsummary obtained a higher ratio of valid modules (invalid values from two datasets were deemed as zero). A prior study adopted Zsummary to validate CASTxB6 female liver modules with 9 other expression datasets and revealed an average VSR of 86.44%74. However, Zsummary also had a higher Fluctuation Ratio (FR, 80.92%) than AU P-value (45.84%), indicating that the stability of the AU P-value results was superior to that of Zsummary (Fig. 3F).

Correlation between the network parameters and the ratio of valid modules

To further determine which network parameters influence the ratio of valid modules of the Zsummary and AU P-value methods, we selected 6 main network parameters of the 10 datasets (Supplementary Table 2), i.e., modularity, density, clustering coefficient, characteristic path length, network heterogeneity, and network centralization. Linear regression analysis indicated that none of these 6 parameters was correlated with the valid module ratio of the Zsummary and AU P-value methods (Fig. 4). This implied that the valid module ratio of genomic networks may not be influenced by a single network parameter.

Figure 4. The relationship between the percentage of valid (preserved or significant) modules (y-axis) and the network parameters (x-axis).

Figure 4

The network parameters were calculated by plugins in Cytoscape. (A,B) MCL versus valid module percentage. (C,D) Density versus valid module percentage. (E,F) Clustering coefficient versus valid module percentage. (G,H) Characteristic path length versus valid module percentage. (I,J) Network heterogeneity versus valid module percentage. (K,L) Network centralization versus valid module percentage. The red line added to each plot is the linear regression line with intercept 0 and slope 1.

Impact of gray area variation on 8 datasets

The gray area was the region of gray genes that was not assigned into any module and labeled in gray by WGCNA. Except for the two datasets (GSE6448 and GSE29230) without valid Zsummary values, 8 datasets were simulated by changing the gray area genes’ expression levels to 0.1, 0.5, 0.9, 1.1, 1.5, and 2 times that of the original dataset. Based on each simulated dataset, WGCNA (an R package used to compute Zsummary) and pvclust (an R package used to compute AU p-value) were performed for module identification and validation. For WGCNA, 5 datasets (GSE2283, GSE12148, GSE6738, GSE12520, and GSE4882) had no changes at the 6 simulated levels compared with the original datasets (a change in Zsummary less than the cutoff value was considered as no change). The changes in the number of modules or gray genes (only for WGCNA) and Variation Ratio (VR) for the remaining 3 datasets are shown in Fig. 5A–C. For pvclust, changes were observed in all 8 datasets compared with the original datasets, and the changes in the module number and VR are shown in Fig. 5D–K. No correlation was found between the VR and the simulated levels in the changed datasets.

Figure 5. The changes of modules or gray genes (only for WGCNA) on 8 datasets by Gray area simulation.

Figure 5

The blue spots represent the number of modules identified by WGCNA or pvclust. The red spots represent the number of valid (preserved or significant) modules. The gray spots are the number of gray genes. The numerical value above the spots is the VR at 6 simulated levels compared with the original dataset.

Comparison of TBA and SBA by Gray area simulation

For the 8 datasets, the average VRs of WGCNA and pvclust at the 6 simulated levels are shown in Fig. 6A. With regard to WGCNA, only the VRs in the changed datasets were calculated. The VRs of WGCNA and pvclust in all simulated datasets can be seen in Fig. 6B. WGCNA had a higher VR (8.43%) for module identification but a lower VR (8.10%) for module validation. By contrast, pvclust had a lower VR (1.29%) for module identification and a higher VR (14.06%) for module validation. Thus, the gray area changes had different impacts on the two models in terms of module identification and validation. Moreover, the VSR and FR of TBA (Zsummary) and SBA (AU p-value) were stable at each simulated level (Fig. 6C). Zsummary had a higher VSR and FR at each simulated level (2 datasets with invalid Zsummary values were not included). When data at all 6 simulated levels were aggregated, the VSR of Zsummary and AU p-value was 63.82% and 12.30%, and the FR was 55.84% and 51.42%, respectively.

Figure 6. Comparison of WGCNA (Zsummary) and pvclust (AU p-value) on Grey area simulated datasets.

Figure 6

(A) The average VR of the modules and genes of 8 datasets. (B) The average VR of WGCNA and pvclust of all simulated datasets. The red bars represent WGCNA, and the blue bars represent pvclust. (C) The VSR and FR of Zsummary and AU P-value of 8 datasets at 6 simulated levels. The red bars represent Zsummary, and the blue bars represent AU P-value.

Discussion

Functional enrichment and biological experiments based on module validation methods may not satisfy the rising demands of various omics networks. As an alternative choice, CVAMA can potentially provide an analytical assessment of the structure and stability of modules captured by various partitioning methods and should be considered as a crucial tool in the interpretation of network modules. The feasibility of CVAMA was demonstrated in our applications of TBA and SBA-based module validation methods in genomic network modules. As a TBA, Zsummary had a high VSR (51%) but also a high FR (80.92%) and was impeded by small module size. As an SBA, AU p-value had a low FR (45.84%) but also a low VSR (12.3%). The Gray area simulated study showed that the VSR and FR of both TBA (Zsummary) and SBA (AU p-value) remained stable at each simulated level. Meanwhile, TBA (Zsummary) had a lower VR (8.10%) for module validation at the 6 simulated levels, indicating that the gray gene changes had little impact on the topology-based models. Although different validation results were obtained by the two types of method with different gene expression datasets and module detection methods, one may choose an appropriate validation index based on the topological structure or stability of the modules. For example, if we focus on whether a module is structurally different from the rest of the network, we may use Zsummary to assess its preservation. If we focus on whether a module is stable or robust, we may choose AU P-value to assess its confidence. Taken together, the existing methods are not ideal, and further improvement is justified.

Modular analysis in genomic networks is a complicated process that involves various factors. In general, there is no “golden standard” for assessing the validity and quality of modules, and different algorithms for module identification with different parameters may produce disparate module partition results4,75,76. Thus, it is difficult to determine which module is “correct” and which module partition method outperforms others. As our application demonstrated, different types of module validation indexes for the same network may generate different outcomes. Generally speaking, each type of module validation method may have its own advantages and disadvantages, and some methods may require certain conditions (e.g., data type, network pattern, or module identification method), limiting their applicability and flexibility. There is no universally acceptable approach that can perform well for all types of data under all scenarios, which results in challenges to make a clear-cut prescription for genomic module validation.

As for the possible discordance between topological criteria and biological meaning in module identification77, methods combining both function and structure have been proposed to identify functional modules78. Similarly, function and topology are also the two aspects of module validation. CVAMA may neglect the biological meaning and directly assess the correlation of modules with known functional annotation, which may deviate from the densely connected property. It is assumed that fusion of functional and topological evaluation may lead to a high quality selection of better modules. However, most of the existing methods in published literature focus on either function or topology, and researchers may only be interested in their own subject or module identification algorithm. Therefore, module validation methods that integrate both functional and topological indexes and are independent of the vagaries of module detection algorithms need to be further explored.

For the modules obtained by clustering algorithms, internal and external cluster validation methods for assessing the quality of clustering results have been discussed in previous studies47,79. The internal validation attempts to measure how well a given partitioning corresponds to the natural cluster structure of the data, and such indexes include compactness, connectedness, separation, combinations, and stability41. External validation attempts to compare the recovered structure to a priori knowledge and to quantify the match between them, and such indexes include unary measures and binary measures79. In addition to cluster quality assessment, how to estimate the optimal number of clusters has also been discussed40,80. Generally, if a module is known to be consistent with the known knowledge, it would show stronger evidence of preservation than a module without a priori evidence, such as a known pathway or co-transcriptional regulation17,81,82,83.

Gene interactions are dynamic in regulating the functioning of cells and organisms84,85. A number of studies have focused on dynamic module identification, as well as the dynamic behavior of modules in networks11,86,87. As such, module validation should not be constrained to a static situation. Modular dynamics may involve time-series molecular interaction88, environment changes89, phenotypic changes90,91, and ontogenetic and phylogenetic time92,93. Dynamic evaluation of modules in certain dynamic processes may generate more comprehensive results, which cannot be obtained in a static state. The more meaningful consequence is intertwined with greater challenges in dynamic CVAMA.

Therefore, to address the challenge of omics-based module validation, computing-based methods are an easy and feasible choice. Despite these challenges, CVAMA, in addition to functional enrichment and biological experiments, offers novel insights into module network research and may become a new paradigm in modular analysis.

Materials and Methods

Datasets and samples

Gene expression datasets were obtained from the GEO database (http://www.ncbi.nlm.nih.gov/geo/). Eleven spotted DNA/cDNA datasets from different organisms and experiment platforms were downloaded, with the sample size ranging from 28 to 592, and the gene number ranging from 448 to 3,520. Because a test dataset was needed for Zsummary and medianRank, we selected half of the samples in each dataset as reference data and the other half as test data. The raw gene-expression information is shown in Supplementary Table 2.

Network construction and network parameter calculation

For each genomic dataset, weighted gene co-expression network analysis (WGCNA)73 was used to construct a network and to detect modules. The freely available WGCNA R package and R tutorials were described in73. After network construction, we exported each network to Cytoscape software94. Network analysis was conducted with the NetworkAnalyzer95 plugin to calculate the network topological parameters. Network modularity was calculated by the CommFinder96 plugin in Cytoscape. The network topological parameters and modularity are listed in Supplementary Table 2.

Zsummary and medianRank module preservation statistics

Zsummary is an integrated statistic implemented in functional module preservation in the WGCNA R package35. It is composed of 4 statistics related to density and 3 statistics related to connectivity that can quantitatively assess whether the density and connectivity patterns of modules defined in a reference dataset are preserved in a test dataset. A Zsummary value between 2 and 10 indicates moderate module preservation, whereas a Zsummary > 10 provides strong support for module preservation35. Another integrated index, medianRank35, is also composed of statistics related to density and connectivity. It is a rank-based measure to compare the relative preservation among multiple modules; a module with lower medianRank tends to exhibit stronger observed preservation.

Approximately unbiased (AU) p-value

The AU p-value, computed by multi-scale bootstrap resampling97, was selected as a representative SBA index. The AU p-value is often used to assess the uncertainty of clustering analysis98. In our application, the AU p-value was computed using the R package pvclust99 with 1,000 times resampling, varying the bootstrap sample size from 0.5 to 1.4-fold the real sample size of the gene expression data. We set clusters with an AU p-value larger than 0.95 as significant modules99.

Validation success ratio (VSR) and fluctuation ratio (FR)

The VSR and FR were defined for comparing the two types of module validation approaches on multiple datasets. The VSR (Eq. 1) was defined as the average percentage of valid modules against all modules available on multiple datasets. The FR (Eq. 2) was defined as the stability or variation degree of the percentage of valid modules on multiple datasets; a lower FR indicated that the percentage of valid modules was more stable.

graphic file with name srep15258-m1.jpg
graphic file with name srep15258-m2.jpg

where R is the ratio of valid modules on one dataset, and N is the number of all available datasets.

Simulated comparisons by changing the gray area gene expression level

In WGCNA, genes that were not assigned into any module were labeled in gray. We called these gray gene regions the gray area. The gray area represented genes whose profiles were simulated to be independent (i.e., without any correlation structure). To illustrate the impact of gray area changes on module identification and validation by TBA and SBA, we changed the gray area genes’ expression levels to 0.1, 0.5, 0.9, 1.1, 1.5, and 2 times that of the original datasets to obtain simulated datasets. Based on the simulated datasets, we compared the Variation Ratio (VR, Eq. 3) of TBA (WGCNA) and SBA (pvclust) for module identification and validation.

graphic file with name srep15258-m3.jpg

where ΔX is the changed number of modules or genes relative to the original data, and n is the number of the simulated datasets.

Additional Information

How to cite this article: Li, B. et al. Quantitative assessment of gene expression network module-validation methods. Sci. Rep. 5, 15258; doi: 10.1038/srep15258 (2015).

Supplementary Material

supplementary table 1
srep15258-s1.doc (105KB, doc)

Acknowledgments

The authors’ work is funded by the National Natural Science Foundation of China (90209015) and the Foundation of ‘Eleventh Five’ National Key Technologies R&D Programmer (2006BAI08B04-06). The funders had no role in study design, data ollection and analysis, decision to publish, or preparation of the manuscript.

Footnotes

Author Contributions Z.W. and Y.W. designed and coordinated the study. Y.Y., Y.Z., P.W. and B.L. performed data analysis. B.L. and Y.W. wrote and modified the manuscript. All authors reviewed, edited and approved the final manuscript.

References

  1. Lorenz D. M., Jeng A. & Deem M. W. The emergence of modularity in biological systems. Physics of life reviews 8, 129–160, 10.1016/j.plrev.2011.02.003 (2011). [DOI] [PMC free article] [PubMed] [Google Scholar]
  2. Newman M. E. Modularity and community structure in networks. Proceedings of the National Academy of Sciences of the United States of America 103, 8577–8582, 10.1073/pnas.0601602103 (2006). [DOI] [PMC free article] [PubMed] [Google Scholar]
  3. Ziv E., Middendorf M. & Wiggins C. Information-theoretic approach to network modularity. Physical Review E 71, 10.1103/PhysRevE.71.046117 (2005). [DOI] [PubMed] [Google Scholar]
  4. Chen Y., Wang Z. & Wang Y. Spatiotemporal positioning of multipotent modules in diverse biological networks. Cellular and molecular life sciences: CMLS 71, 2605–2624, 10.1007/s00018-013-1547-2 (2014). [DOI] [PMC free article] [PubMed] [Google Scholar]
  5. Sridharan G. V., Yi M., Hassoun S. & Lee K. Metabolic flux-based modularity using shortest retroactive distances. BMC systems biology 6, 155, 10.1186/1752-0509-6-155 (2012). [DOI] [PMC free article] [PubMed] [Google Scholar]
  6. Ihmels J., Bergmann S., Berman J. & Barkai N. Comparative gene expression analysis by differential clustering approach: application to the Candida albicans transcription program. PLoS genetics 1, e39 (2005). [DOI] [PMC free article] [PubMed] [Google Scholar]
  7. Wang J., Li M., Deng Y. & Pan Y. Recent advances in clustering methods for protein interaction networks. BMC genomics 11 Suppl 3, S10, 10.1186/1471-2164-11-S3-S10 (2010). [DOI] [PMC free article] [PubMed] [Google Scholar]
  8. Wu Z., Zhao X. & Chen L. Identifying responsive functional modules from protein-protein interaction network. Molecules and cells 27, 271–277, 10.1007/s10059-009-0035-x (2009). [DOI] [PubMed] [Google Scholar]
  9. Dittrich M. T., Klau G. W., Rosenwald A., Dandekar T. & Muller T. Identifying functional modules in protein-protein interaction networks: an integrated exact approach. Bioinformatics 24, i223–231, 10.1093/bioinformatics/btn161 (2008). [DOI] [PMC free article] [PubMed] [Google Scholar]
  10. Ulitsky I. & Shamir R. Identifying functional modules using expression profiles and confidence-scored protein interactions. Bioinformatics 25, 1158–1164, 10.1093/bioinformatics/btp118 (2009). [DOI] [PubMed] [Google Scholar]
  11. Wang X., Dalkic E., Wu M. & Chan C. Gene module level analysis: identification to networks and dynamics. Current opinion in biotechnology 19, 482–491, 10.1016/j.copbio.2008.07.011 (2008). [DOI] [PMC free article] [PubMed] [Google Scholar]
  12. Chin C. H., Chen S. H., Ho C. W., Ko M. T. & Lin C. Y. A hub-attachment based method to detect functional modules from confidence-scored protein interactions and expression profiles. BMC bioinformatics 11 Suppl 1, S25, 10.1186/1471-2105-11-S1-S25 (2010). [DOI] [PMC free article] [PubMed] [Google Scholar]
  13. Zhang W., Edwards A., Fan W., Zhu D. & Zhang K. svdPPCS: an effective singular value decomposition-based method for conserved and divergent co-expression gene module identification. BMC bioinformatics 11, 338, 10.1186/1471-2105-11-338 (2010). [DOI] [PMC free article] [PubMed] [Google Scholar]
  14. Li H., Sun Y. & Zhan M. The discovery of transcriptional modules by a two-stage matrix decomposition approach. Bioinformatics 23, 473–479, 10.1093/bioinformatics/btl640 (2007). [DOI] [PubMed] [Google Scholar]
  15. Ashburner M. et al. Gene ontology: tool for the unification of biology. The Gene Ontology Consortium. Nature genetics 25, 25–29, 10.1038/75556 (2000). [DOI] [PMC free article] [PubMed] [Google Scholar]
  16. Lysenko A. et al. Assessing the functional coherence of modules found in multiple-evidence networks from Arabidopsis. BMC bioinformatics 12, 203, 10.1186/1471-2105-12-203 (2011). [DOI] [PMC free article] [PubMed] [Google Scholar]
  17. Li W. et al. Integrative analysis of many weighted co-expression networks using tensor computation. PLoS computational biology 7, e1001106, 10.1371/journal.pcbi.1001106 (2011). [DOI] [PMC free article] [PubMed] [Google Scholar]
  18. Colak R. et al. Module discovery by exhaustive search for densely connected, co-expressed regions in biomolecular interaction networks. PloS one 5, e13348, 10.1371/journal.pone.0013348 (2010). [DOI] [PMC free article] [PubMed] [Google Scholar]
  19. Minguez P. & Dopazo J. Assessing the biological significance of gene expression signatures and co-expression modules by studying their network properties. PloS one 6, e17474, 10.1371/journal.pone.0017474 (2011). [DOI] [PMC free article] [PubMed] [Google Scholar]
  20. Hou L. et al. Modular analysis of the probabilistic genetic interaction network. Bioinformatics 27, 853–859, 10.1093/bioinformatics/btr031 (2011). [DOI] [PMC free article] [PubMed] [Google Scholar]
  21. Marras E., Travaglione A., Chaurasia G., Futschik M. & Capobianco E. Inferring modules from human protein interactome classes. BMC systems biology 4, 102, 10.1186/1752-0509-4-102 (2010). [DOI] [PMC free article] [PubMed] [Google Scholar]
  22. Reimand J., Tooming L., Peterson H., Adler P. & Vilo J. GraphWeb: mining heterogeneous biological networks for gene modules with functional significance. Nucleic acids research 36, W452–459, 10.1093/nar/gkn230 (2008). [DOI] [PMC free article] [PubMed] [Google Scholar]
  23. Kim W., Li M., Wang J. & Pan Y. Biological network motif detection and evaluation. BMC systems biology 5 Suppl 3, S5, 10.1186/1752-0509-5-S3-S5 (2011). [DOI] [PMC free article] [PubMed] [Google Scholar]
  24. Hodgkinson L. & Karp R. M. Optimization criteria and biological process enrichment in homologous multiprotein modules. Proceedings of the National Academy of Sciences of the United States of America 110, 10872–10877, 10.1073/pnas.1308621110 (2013). [DOI] [PMC free article] [PubMed] [Google Scholar]
  25. Wang X., Castro M. A., Mulder K. W. & Markowetz F. Posterior association networks and functional modules inferred from rich phenotypes of gene perturbations. PLoS computational biology 8, e1002566, 10.1371/journal.pcbi.1002566 (2012). [DOI] [PMC free article] [PubMed] [Google Scholar]
  26. Ozaki S. et al. Coexpression analysis of tomato genes and experimental verification of coordinated expression of genes found in a functionally enriched coexpression module. DNA research: an international journal for rapid publication of reports on genes and genomes 17, 105–116, 10.1093/dnares/dsq002 (2010). [DOI] [PMC free article] [PubMed] [Google Scholar]
  27. Romanoski C. E. et al. Network for activation of human endothelial cells by oxidized phospholipids: a critical role of heme oxygenase 1. Circulation research 109, e27–41, 10.1161/CIRCRESAHA.111.241869 (2011). [DOI] [PMC free article] [PubMed] [Google Scholar]
  28. Pradhan M. P., Prasad N. K. & Palakal M. J. A systems biology approach to the global analysis of transcription factors in colorectal cancer. BMC cancer 12, 331, 10.1186/1471-2407-12-331 (2012). [DOI] [PMC free article] [PubMed] [Google Scholar]
  29. Bundy J. G. et al. Evaluation of predicted network modules in yeast metabolism using NMR-based metabolite profiling. Genome research 17, 510–519, 10.1101/gr.5662207 (2007). [DOI] [PMC free article] [PubMed] [Google Scholar]
  30. de Jong S. et al. A gene co-expression network in whole blood of schizophrenia patients is independent of antipsychotic-use and enriched for brain-expressed genes. PloS one 7, e39498, 10.1371/journal.pone.0039498 (2012). [DOI] [PMC free article] [PubMed] [Google Scholar]
  31. Koyuturk M., Szpankowski W. & Grama A. Assessing significance of connectivity and conservation in protein interaction networks. Journal of computational biology: a journal of computational molecular cell biology 14, 747–764, 10.1089/cmb.2007.R014 (2007). [DOI] [PubMed] [Google Scholar]
  32. He D., Liu Z. P. & Chen L. Identification of dysfunctional modules and disease genes in congenital heart disease by a network-based approach. BMC genomics 12, 592, 10.1186/1471-2164-12-592 (2011). [DOI] [PMC free article] [PubMed] [Google Scholar]
  33. Chen L., Xuan J., Riggins R. B., Wang Y. & Clarke R. Identifying protein interaction subnetworks by a bagging Markov random field-based method. Nucleic acids research 41, e42, 10.1093/nar/gks951 (2013). [DOI] [PMC free article] [PubMed] [Google Scholar]
  34. Gaire R. K. et al. Discovery and analysis of consistent active sub-networks in cancers. BMC bioinformatics 14 Suppl 2, S7, 10.1186/1471-2105-14-S2-S7 (2013). [DOI] [PMC free article] [PubMed] [Google Scholar]
  35. Langfelder P., Luo R., Oldham M. C. & Horvath S. Is my network module preserved and reproducible? PLoS computational biology 7, e1001057, 10.1371/journal.pcbi.1001057 (2011). [DOI] [PMC free article] [PubMed] [Google Scholar]
  36. Dong J. & Horvath S. Understanding network concepts in modules. BMC systems biology 1, 24, 10.1186/1752-0509-1-24 (2007). [DOI] [PMC free article] [PubMed] [Google Scholar]
  37. Georgii E., Dietmann S., Uno T., Pagel P. & Tsuda K. Enumeration of condition-dependent dense modules in protein interaction networks. Bioinformatics 25, 933–940, 10.1093/bioinformatics/btp080 (2009). [DOI] [PMC free article] [PubMed] [Google Scholar]
  38. Gerlee P., Lizana L. & Sneppen K. Pathway identification by network pruning in the metabolic network of Escherichia coli. Bioinformatics 25, 3282–3288, 10.1093/bioinformatics/btp575 (2009). [DOI] [PubMed] [Google Scholar]
  39. Girvan M. & Newman M. E. Community structure in social and biological networks. Proceedings of the National Academy of Sciences of the United States of America 99, 7821–7826, 10.1073/pnas.122653799 (2002). [DOI] [PMC free article] [PubMed] [Google Scholar]
  40. Zhang Y., Xuan J., de los Reyes B. G., Clarke R. & Ressom H. W. Reverse engineering module networks by PSO-RNN hybrid modeling. BMC genomics 10 Suppl 1, S15, 10.1186/1471-2164-10-S1-S15 (2009). [DOI] [PMC free article] [PubMed] [Google Scholar]
  41. Pihur V., Datta S. & Datta S. Weighted rank aggregation of cluster validation measures: a Monte Carlo cross-entropy approach. Bioinformatics 23, 1607–1615, 10.1093/bioinformatics/btm158 (2007). [DOI] [PubMed] [Google Scholar]
  42. Kim Y. A., Salari R., Wuchty S. & Przytycka T. M. Module cover—a new approach to genotype-phenotype studies. Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing, 135–146, 10.1142/9789814447973_0014 (2013). [DOI] [PMC free article] [PubMed]
  43. Rau C. D. et al. Maximal information component analysis: a novel non-linear network analysis method. Frontiers in genetics 4, 28, 10.3389/fgene.2013.00028 (2013). [DOI] [PMC free article] [PubMed] [Google Scholar]
  44. Dewey F. E. et al. Gene coexpression network topology of cardiac development, hypertrophy, and failure. Circulation. Cardiovascular genetics 4, 26–35, 10.1161/CIRCGENETICS.110.941757 (2011). [DOI] [PMC free article] [PubMed] [Google Scholar]
  45. Chin C. H. et al. Spotlight: assembly of protein complexes by integrating graph clustering methods. Gene 518, 42–51, 10.1016/j.gene.2012.11.087 (2013). [DOI] [PubMed] [Google Scholar]
  46. Lázár A., Ábel D. & Vicsek T. Modularity measure of networks with overlapping communities. EPL (Europhysics Letters) 90, 18001, 10.1209/0295-5075/90/18001 (2010). [DOI] [Google Scholar]
  47. Yona G., Dirks W. & Rahman S. Comparing algorithms for clustering of expression data: how to assess gene clusters. Methods in molecular biology 541, 479–509, 10.1007/978-1-59745-243-4_21 (2009). [DOI] [PubMed] [Google Scholar]
  48. Hsu J. T., Peng C. H., Hsieh W. P., Lan C. Y. & Tang C. Y. A novel method to identify cooperative functional modules: study of module coordination in the Saccharomyces cerevisiae cell cycle. BMC bioinformatics 12, 281, 10.1186/1471-2105-12-281 (2011). [DOI] [PMC free article] [PubMed] [Google Scholar]
  49. Street N. R., Jansson S. & Hvidsten T. R. A systems biology model of the regulatory network in Populus leaves reveals interacting regulators and conserved regulation. BMC plant biology 11, 13, 10.1186/1471-2229-11-13 (2011). [DOI] [PMC free article] [PubMed] [Google Scholar]
  50. Hendrix W. et al. DENSE: efficient and prior knowledge-driven discovery of phenotype-associated protein functional modules. BMC systems biology 5, 172, 10.1186/1752-0509-5-172 (2011). [DOI] [PMC free article] [PubMed] [Google Scholar]
  51. Schmidt M. C. et al. Efficient alpha, beta-motif finder for identification of phenotype-related functional modules. BMC bioinformatics 12, 440, 10.1186/1471-2105-12-440 (2011). [DOI] [PMC free article] [PubMed] [Google Scholar]
  52. Shi Z., Derow C. K. & Zhang B. Co-expression module analysis reveals biological processes, genomic gain, and regulatory mechanisms associated with breast cancer progression. BMC systems biology 4, 74, 10.1186/1752-0509-4-74 (2010). [DOI] [PMC free article] [PubMed] [Google Scholar]
  53. Wen Z., Liu Z. P., Liu Z., Zhang Y. & Chen L. An integrated approach to identify causal network modules of complex diseases with application to colorectal cancer. Journal of the American Medical Informatics Association: JAMIA 20, 659–667, 10.1136/amiajnl-2012-001168 (2013). [DOI] [PMC free article] [PubMed] [Google Scholar]
  54. Wen Z. et al. Identifying responsive modules by mathematical programming: an application to budding yeast cell cycle. PloS one 7, e41854, 10.1371/journal.pone.0041854 (2012). [DOI] [PMC free article] [PubMed] [Google Scholar]
  55. Sanderson M. J. & Wojciechowski M. F. Improved bootstrap confidence limits in large-scale phylogenies, with an example from Neo-Astragalus (Leguminosae). Systematic biology 49, 671–685 (2000). [DOI] [PubMed] [Google Scholar]
  56. Beisser D. et al. Robustness and accuracy of functional modules in integrated network analysis. Bioinformatics 28, 1887–1894, 10.1093/bioinformatics/bts265 (2012). [DOI] [PubMed] [Google Scholar]
  57. He D., Liu Z. P., Honda M., Kaneko S. & Chen L. Coexpression network analysis in chronic hepatitis B and C hepatic lesions reveals distinct patterns of disease progression to hepatocellular carcinoma. Journal of molecular cell biology 4, 140–152, 10.1093/jmcb/mjs011 (2012). [DOI] [PubMed] [Google Scholar]
  58. Jia P. et al. Network-assisted investigation of combined causal signals from genome-wide association studies in schizophrenia. PLoS computational biology 8, e1002587, 10.1371/journal.pcbi.1002587 (2012). [DOI] [PMC free article] [PubMed] [Google Scholar]
  59. Sharan R. & Ideker T. Modeling cellular machinery through biological network comparison. Nature biotechnology 24, 427–433, 10.1038/nbt1196 (2006). [DOI] [PubMed] [Google Scholar]
  60. Zhang M. & Lu L. J. Investigating the validity of current network analysis on static conglomerate networks by protein network stratification. BMC bioinformatics 11, 466, 10.1186/1471-2105-11-466 (2010). [DOI] [PMC free article] [PubMed] [Google Scholar]
  61. Zinman G. E., Zhong S. & Bar-Joseph Z. Biological interaction networks are conserved at the module level. BMC systems biology 5, 134, 10.1186/1752-0509-5-134 (2011). [DOI] [PMC free article] [PubMed] [Google Scholar]
  62. Kapp A. V. & Tibshirani R. Are clusters found in one dataset present in another dataset? Biostatistics 8, 9–31, 10.1093/biostatistics/kxj029 (2007). [DOI] [PubMed] [Google Scholar]
  63. Padmanabhan K., Wang K. & Samatova N. F. Functional annotation of hierarchical modularity. PloS one 7, e33744, 10.1371/journal.pone.0033744 (2012). [DOI] [PMC free article] [PubMed] [Google Scholar]
  64. Hsu C. H., Wang T. Y., Chu H. T., Kao C. Y. & Chen K. C. A quantitative analysis of monochromaticity in genetic interaction networks. BMC bioinformatics 12 Suppl 13, S16, 10.1186/1471-2105-12-S13-S16 (2011). [DOI] [PMC free article] [PubMed] [Google Scholar]
  65. Ma N. & Zhang Z. G. Evaluation of clustering algorithms for gene expression data using gene ontology annotations. Chinese medical journal 125, 3048–3052 (2012). [PubMed] [Google Scholar]
  66. King A. D., Przulj N. & Jurisica I. Protein complex prediction via cost-based clustering. Bioinformatics 20, 3013–3020, 10.1093/bioinformatics/bth351 (2004). [DOI] [PubMed] [Google Scholar]
  67. Ma X. & Gao L. Discovering protein complexes in protein interaction networks via exploring the weak ties effect. BMC systems biology 6 Suppl 1, S6, 10.1186/1752-0509-6-S1-S6 (2012). [DOI] [PMC free article] [PubMed] [Google Scholar]
  68. Pereira-Leal J. B., Enright A. J. & Ouzounis C. A. Detection of functional modules from protein interaction networks. Proteins 54, 49–57, 10.1002/prot.10505 (2004). [DOI] [PubMed] [Google Scholar]
  69. Sun P. G., Gao L. & Han S. Prediction of human disease-related gene clusters by clustering analysis. International journal of biological sciences 7, 61–73 (2011). [DOI] [PMC free article] [PubMed] [Google Scholar]
  70. Wang J., Ren J., Li M. & Wu F. X. Identification of hierarchical and overlapping functional modules in PPI networks. IEEE transactions on nanobioscience 11, 386–393, 10.1109/TNB.2012.2210907 (2012). [DOI] [PubMed] [Google Scholar]
  71. Li M., Chen J. E., Wang J. X., Hu B. & Chen G. Modifying the DPClus algorithm for identifying protein complexes based on new topological structures. BMC bioinformatics 9, 398, 10.1186/1471-2105-9-398 (2008). [DOI] [PMC free article] [PubMed] [Google Scholar]
  72. Brohee S. & van Helden J. Evaluation of clustering algorithms for protein-protein interaction networks. BMC bioinformatics 7, 488, 10.1186/1471-2105-7-488 (2006). [DOI] [PMC free article] [PubMed] [Google Scholar]
  73. Langfelder P. & Horvath S. WGCNA: an R package for weighted correlation network analysis. BMC bioinformatics 9, 559, 10.1186/1471-2105-9-559 (2008). [DOI] [PMC free article] [PubMed] [Google Scholar]
  74. Langfelder P. et al. A systems genetic analysis of high density lipoprotein metabolism and network preservation across mouse models. Biochimica et biophysica acta 1821, 435–447, 10.1016/j.bbalip.2011.07.014 (2012). [DOI] [PMC free article] [PubMed] [Google Scholar]
  75. Frings O., Alexeyenko A. & Sonnhammer E. L. MGclus: network clustering employing shared neighbors. Molecular bioSystems 9, 1670–1675, 10.1039/c3mb25473a (2013). [DOI] [PubMed] [Google Scholar]
  76. Cui G., Shrestha R. & Han K. ModuleSearch: finding functional modules in a protein-protein interaction network. Computer methods in biomechanics and biomedical engineering 15, 691–699, 10.1080/10255842.2011.555404 (2012). [DOI] [PubMed] [Google Scholar]
  77. Pinkert S., Schultz J. & Reichardt J. Protein interaction networks—more than mere modules. PLoS computational biology 6, e1000659, 10.1371/journal.pcbi.1000659 (2010). [DOI] [PMC free article] [PubMed] [Google Scholar]
  78. Wang Y. & Qian X. A novel subgradient-based optimization algorithm for blockmodel functional module identification. BMC bioinformatics 14 Suppl 2, S23, 10.1186/1471-2105-14-S2-S23 (2013). [DOI] [PMC free article] [PubMed] [Google Scholar]
  79. Handl J., Knowles J. & Kell D. B. Computational cluster validation in post-genomic data analysis. Bioinformatics 21, 3201–3212, 10.1093/bioinformatics/bti517 (2005). [DOI] [PubMed] [Google Scholar]
  80. Mar J. C., Wells C. A. & Quackenbush J. Defining an informativeness metric for clustering gene expression data. Bioinformatics 27, 1094–1100, 10.1093/bioinformatics/btr074 (2011). [DOI] [PMC free article] [PubMed] [Google Scholar]
  81. Liu X., Liu Z. P., Zhao X. M. & Chen L. Identifying disease genes and module biomarkers by differential interactions. Journal of the American Medical Informatics Association: JAMIA 19, 241–248, 10.1136/amiajnl-2011-000658 (2012). [DOI] [PMC free article] [PubMed] [Google Scholar]
  82. Qi J., Michoel T. & Butler G. An integrative approach to infer regulation programs in a transcription regulatory module network. Journal of biomedicine & biotechnology 2012, 245968, 10.1155/2012/245968 (2012). [DOI] [PMC free article] [PubMed] [Google Scholar]
  83. Prieto C., Risueno A., Fontanillo C. & De las Rivas J. Human gene coexpression landscape: confident network derived from tissue transcriptomic profiles. PloS one 3, e3911, 10.1371/journal.pone.0003911 (2008). [DOI] [PMC free article] [PubMed] [Google Scholar]
  84. Jin R. et al. Identifying dynamic network modules with temporal and spatial constraints. Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing. 203–214 (2009). [PubMed] [Google Scholar]
  85. Przytycka T. M., Singh M. & Slonim D. K. Toward the dynamic interactome: it’s about time. Briefings in bioinformatics 11, 15–29, 10.1093/bib/bbp057 (2010). [DOI] [PMC free article] [PubMed] [Google Scholar]
  86. Li W. et al. Dynamical systems for discovering protein complexes and functional modules from biological networks. IEEE/ACM transactions on computational biology and bioinformatics/IEEE, ACM 4, 233–250, 10.1109/TCBB.2007.070210 (2007). [DOI] [PubMed] [Google Scholar]
  87. Li Z., Srivastava S., Findlan R. & Chan C. Using dynamic gene module map analysis to identify targets that modulate free fatty acid induced cytotoxicity. Biotechnology progress 24, 29–37, 10.1021/bp070120b (2008). [DOI] [PMC free article] [PubMed] [Google Scholar]
  88. Goncalves J. P., Aires R. S., Francisco A. P. & Madeira S. C. Regulatory Snapshots: integrative mining of regulatory modules from expression time series and regulatory networks. PloS one 7, e35977, 10.1371/journal.pone.0035977 (2012). [DOI] [PMC free article] [PubMed] [Google Scholar]
  89. Kim D., Kim M. S. & Cho K. H. The core regulation module of stress-responsive regulatory networks in yeast. Nucleic acids research 40, 8793–8802, 10.1093/nar/gks649 (2012). [DOI] [PMC free article] [PubMed] [Google Scholar]
  90. Dimitrakopoulou K. et al. Revealing the dynamic modularity of composite biological networks in breast cancer treatment. Conference proceedings Annual International Conference of the IEEE Engineering in Medicine and Biology Society. IEEE Engineering in Medicine and Biology Society. Conference 2012, 5432–5436, 10.1109/EMBC.2012.6347223 (2012). [DOI] [PubMed] [Google Scholar]
  91. Hernandez-Hernandez V., Niklas K. J., Newman S. A. & Benitez M. Dynamical patterning modules in plant development and evolution. The International journal of developmental biology 56, 661–674, 10.1387/ijdb.120027mb (2012). [DOI] [PubMed] [Google Scholar]
  92. Taylor I. W. et al. Dynamic modularity in protein interaction networks predicts breast cancer outcome. Nature biotechnology 27, 199–204, 10.1038/nbt.1522 (2009). [DOI] [PubMed] [Google Scholar]
  93. Winther R. G. Varieties of modules: kinds, levels, origins, and behaviors. The Journal of experimental zoology 291, 116–129, 10.1002/jez.1064 (2001). [DOI] [PubMed] [Google Scholar]
  94. Shannon P. et al. Cytoscape: a software environment for integrated models of biomolecular interaction networks. Genome research 13, 2498–2504, 10.1101/gr.1239303 (2003). [DOI] [PMC free article] [PubMed] [Google Scholar]
  95. Assenov Y., Ramirez F., Schelhorn S. E., Lengauer T. & Albrecht M. Computing topological parameters of biological networks. Bioinformatics 24, 282–284, 10.1093/bioinformatics/btm554 (2008). [DOI] [PubMed] [Google Scholar]
  96. Ruan J. & Zhang W. Identifying network communities with a high resolution. Physical review. E, Statistical, nonlinear, and soft matter physics 77, 016104 (2008). [DOI] [PubMed] [Google Scholar]
  97. Felsenstein J. Confidence limits on phylogenies: An approach using the bootstrap. Evolution 39, 783–791, (1985). [DOI] [PubMed] [Google Scholar]
  98. Shimodaira H. An approximately unbiased test of phylogenetic tree selection. Systematic biology 51, 492–508, 10.1080/10635150290069913 (2002). [DOI] [PubMed] [Google Scholar]
  99. Suzuki R. & Shimodaira H. Pvclust: an R package for assessing the uncertainty in hierarchical clustering. Bioinformatics 22, 1540–1542, 10.1093/bioinformatics/btl117 (2006). [DOI] [PubMed] [Google Scholar]
  100. Kommadath A. et al. Gene co-expression network analysis identifies porcine genes associated with variation in Salmonella shedding. BMC genomics 15, 452, 10.1186/1471-2164-15-452 (2014). [DOI] [PMC free article] [PubMed] [Google Scholar]
  101. Tong M. et al. A modular organization of the human intestinal mucosal microbiota and its association with inflammatory bowel disease. PloS one 8, e80702, 10.1371/journal.pone.0080702 (2013). [DOI] [PMC free article] [PubMed] [Google Scholar]
  102. Narayanan T., Gersten M., Subramaniam S. & Grama A. Modularity detection in protein-protein interaction networks. BMC research notes 4, 569, 10.1186/1756-0500-4-569 (2011). [DOI] [PMC free article] [PubMed] [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Supplementary Materials

supplementary table 1
srep15258-s1.doc (105KB, doc)

Articles from Scientific Reports are provided here courtesy of Nature Publishing Group

RESOURCES