Microarray experiments have been extensively used to define signatures, which are sets of genes that can be considered markers of experimental conditions (typically diseases). Paradoxically, in spite of the apparent functional role that might be attributed to such gene sets, signatures do not seem to be reproducible across experiments. Given the close relationship between function and protein interaction, network properties can be used to study to what extent signatures are composed of genes whose resulting proteins show a considerable level of interaction (and consequently a putative common functional role).
We have analysed 618 signatures and 507 modules of co-expression in cancer looking for significant values of four main protein-protein interaction (PPI) network parameters: connection degree, cluster coefficient, betweenness and number of components. A total of 3904 gene ontology (GO) modules, 146 KEGG pathways, and 263 Biocarta pathways have been used as functional modules of reference.
Co-expression modules found in microarray experiments display a high level of connectivity, similar to the one shown by conventional modules based on functional definitions (GO, KEGG and Biocarta). A general observation for all the classes studied is that the networks formed by the modules improve their topological parameters when an external protein is allowed to be introduced within the paths (up to the 70% of GO modules show network parameters beyond the random expectation). This fact suggests that functional definitions are incomplete and some genes might still be missing. Conversely, signatures are clearly not capturing the altered functions in the corresponding studies. This is probably because the way in which the genes have been selected in the signatures is too conservative. These results suggest that gene selection methods which take into account relationships among genes should be superior to methods that assume independence among genes outside their functional contexts.
Citation: Minguez P, Dopazo J (2011) Assessing the Biological Significance of Gene Expression Signatures and Co-Expression Modules by Studying Their Network Properties. PLoS ONE 6(3): e17474. https://doi.org/10.1371/journal.pone.0017474
Editor: Francesco Falciani, University of Birmingham, United Kingdom
Received: October 13, 2010; Accepted: February 3, 2011; Published: March 7, 2011
Copyright: © 2011 Minguez, Dopazo. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Funding: This work is supported by grants BIO2008-04212 from the Spanish Ministry of Science and Innovation (MICINN) and PROMETEO/2010/001 from the GVA-FEDER. The authors also thank the support of the National Institute of Bioinformatics (www.inab.org) and the CIBER de Enfermedades Raras, both initiatives of the ISCIII, MICINN. This work is also partly supported by a grant (RD06/0020/1019) from Red Tematica de Investigacion Cooperativa en Cancer (RTICC), ISCIII, MICINN. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.
Competing interests: The authors have declared that no competing interests exist.
Recently, there exist a growing interest in the definition and use of molecular signatures . These are sets of genes that can be considered markers of diseases, experimental conditions, etc. The changes in the cell functionality provoked by the differential expression of such gene modules must be, to some extent, responsible for the phenotypic differences observed in the experiments. However, the concept of signature has been often criticized. These are currently defined as genes with a significant differential expression between the trait of interest and a control condition. The low sensitivity of the tests for differential expression  used to define such signatures produces the well known effect of the instability in its definition  and concerns on the reproducibility or results across laboratories or platforms .
On the other hand, experimental results from microarrays have brought about the definition of de facto co-expression modules , . Typically, biclustering techniques are used to define groups of genes that co-express under a certain range of experimental conditions or in a number of samples. Such modules have been demonstrated to be enriched by functionally-related genes and, generally speaking, are thought to be playing some functional role (despite still uncharacterized in some occasions) .
It is widely accepted that most of the biological functionality of the cell arises from complex interactions between their molecular components that define operational interacting entities or modules . Understanding the structure and the dynamics of the complex intercellular network of interactions that contribute to the structure and function of a living cell is one of the main challenges in functional genomics  and constitutes the objective of systems biology . However, our knowledge of such modules is still very limited and comes from initiatives such as Gene Ontology (GO)  or repositories like the Kioto Encyclopedia of Genes and genomes (KEGG)  or Biocarta pathways . Such initiatives provide conceptual definitions for functionally-related gene modules, usually supervised by curators and based on different types of evidences.
Intuitively, the notion of module makes reference to a number of cell components (commonly genes or proteins) that collectively accomplish a relatively autonomous and delimited function . It is then expected that genes in a functional module display a certain degree of coordinate expression  and that the corresponding gene products are located in physical proximity within the cell, most probably in physical contact in many cases. Actually, it has been reported several times that genes with similar expression profiles are likely to encode interacting proteins , . Thus, making use of these concepts protein function has been predicted from gene co-expression ,  and protein-protein interactions , ,  data.
In an attempt to evaluate the functional significance of the different modules defined in gene expression experiments (signatures and co-expression modules) we have explored their internal connectivity. Thus, de facto definitions of co-expression modules in cancer as well as signatures of different nature (up- and down-regulated genes from cancer and non-cancer studies), taken from the L2L resource  were mapped onto the scaffold of the interactome. Different network parameters were evaluated and tested for the corresponding sub-networks to assess the degree of internal structure in such modules. In order to calibrate whether the degree of connectivity found corresponded to what it was expectable from modules with a real functional role or not, known functional modules (defined as GO, KEGG and Biocarta categories) were used as reference.
The results obtained clearly indicate that signatures obtained from expression profiling experiments contain little network structure. Contrarily, co-expression modules seem to display a higher level of internal network structure similar to the level found in conventional functional modules.
PPI network enrichment in reference module definitions: Gene Ontology, KEGG and Biocarta
A list of 8462 sets of transcripts sharing a particular Gene Ontology term was generated by considering. Here, we consider any gene as member of the GO module at which it is annotated as well as all of the parent modules too . Of a total of 8462 GO modules, those with less than three components (4284 GO terms) or more than 200 (274 GO terms) were discarded from the analysis given the difficulties for building empirical random distributions outside of this range. The final analysis was performed over 3904 GO modules. For every GO module two Minimal Connected Networks (MCNs) were computed and tested by PPI network enrichment method : one of them including only proteins annotated with the GO and a second one in which the introduction of one external node in the network is allowed (see methods). Thus, the distributions of values of degree, betweenness and clustering coefficient for all the nodes and the number of components of the network were calculated and compared to their random expectations.
Table 1 shows the percentage of GO terms showing unexpectedly high or low values for these parameters. The distribution of values for the connection degree parameter is significantly above of the random expectations for more than one third of the GO terms. The number of components is significantly lower than expected by chance in one fourth of the GO terms. If the analysis is conducted allowing one extra node, these figures rise significantly (see Table 1), suggesting that some terms could be incomplete in their original definitions.
When the results are segregated into the GO main categories, biological process, molecular function and cellular component, the last one seem to present more internal network structure (see Table 2). Specifically, in the case of connection degree, half of the cellular component modules present values higher than the random expectation. On the opposite side, the molecular function category presents a low internal network structure.
The specificity of the GO term is represented by the level: the deeper the level the more specific the definition. Network properties do not seem to be especially affected by the GO level, and remain constant over a wide range (approximately from 3 to 14, that covers the range of application of the method) (see Figure 1). Clustering coefficient seems to slightly escape to this trend by reducing its value as the GO depth increases. This is probably an effect of the reduction in the number of proteins as the GO depth increases that affects more to this network property.
It is worth mentioning that GO terms contain different types of conceptualizations of cell functionality. Consequently, some of them do not make direct reference to entities that could be assimilated to a functional module for which one can expect a certain level of co-expression and/or interaction. There is also a certain level of redundancy given by the GO levels that can be observed in the position in the DAG hierarchy that the significant terms have (many are located along branches). Taking these facts into account it can be corroborated that GO terms mainly represent highly interacting gene modules.
The same analysis of network parameters was conducted for human KEGG pathways. Out of a total of 188 KEGG pathways, 41 of them were composed by less than 3 transcripts and 1 by more than 200 transcripts. Thus a total of 146 MCNs were computed. In the case of Biocarta pathways, from a total of 313 pathways there were 50 of them with less than 3 transcripts so, after removing them, 263 MCNs were generated. Table 1 shows the results obtained. KEGG and Biocarta modules display even higher values of connection degree (in the last case up to half of the modules show a value for the parameter significantly higher than the random expectation). The most remarkable difference was found in the cluster coefficient parameter, which was extremely low in the case of Biocarta modules (only 1.9% of the modules show a value higher than the random expectation, which rises to a 14.8% if one extra node is allowed). This might be a consequence of the nature of the modules represented in Biocarta, which mostly contain signalling networks for which a high connection degree but not a high clustering coefficient is expectable. Again, if an extra node is allowed, the values of the network parameters raise significantly (see Table 1). This observation suggests again that some terms could be incomplete in their original definitions. Alternatively, some proteins that do not belong to the modules could be connecting different parts of the module, helping them to be physically close.
PPI network enrichment in co-expression modules and signatures defined by microarray experiments
A total of 618 signatures (differentially expressed genes) from human microarray experimental results and 507 modules of co-expression in cancer were downloaded from L2L . A PPI network enrichment analysis was conducted for each of the modules. It has previously been described that proteins not selected as part of signatures in microarray experiments were related to disease due to its inclusion into a network of PPIs , . Thus, the analyses here were conducted allowing one extra node in the MCN calculations.
The most remarkable observation is that the proportion of co-expression modules with significant network parameters is higher than the equivalent values in the signatures and more similar to the corresponding values observed for GO, KEGG or Biocarta (see Table 3). These results suggest that co-expression modules could be representing functional modules of similar nature than the ones defined by GO, KEGG or, Biocarta.
On the other hand signatures most probably constitute incomplete descriptions of the functions activated or deactivated in the different scenarios studied. Signatures have been obtained by applying individual, independent tests to any of the genes represented in the microarray followed by a correction for multiple testing. It is known that this results in a considerable lack of statistical power in the testing schema . Obviously, the way in which the relevant genes in the signature are defined is implicitly conditioning the functional interpretation of the whole experiment. Paradoxically, many of the biological properties used to define gene modules (function, regulation, etc.) implies the existence of a high level of cooperative activity among them (in practical terms co-expression , ,  and protein interactions), while most of the tests used to select relevant genes assume independence in the behaviours of the genes imposing thus an artificial threshold with a unfavourable effect in the results . This also explains why co-expression modules have more internal network properties.
Comparison of network properties among the different module definitions
When the network properties (measured as the number of significant different network parameters) are compared across all the module definitions, GO and KEGG display a greater amount of network structure (see Table 3). In fact, KEGG shows higher betweenness and clustering coefficient while GO seems to be more connected although less structured. Both GO and KEGG display the highest proportions of modules (more than 50%) that have significantly less components than it would be expected just by chance, which is again presumable if an underlying network structure exists. Surprisingly Biocarta pathways present fewer cases with significant network parameters than GO or KEGG, being more comparable to what it was observed for co-expression modules. Signatures have been sub-classified according to two criteria: cancer versus non-cancer and up-regulated versus down-regulated. In general, signatures have a low number of cases with significant network parameters when compared to the other module definitions. It is worth noticing that cancer signatures and down-regulated signatures have higher values of clustering coefficient that non-cancer signatures and up-regulated signatures, suggesting the existence of a more interconnected network in the genes differentially expressed in these experimental conditions, which is in agreement with previous observations .
When the distributions of the network parameters are studied the results are similar: co-expression modules seem to be in between functional modules of reference (GO, KEGG and Biocarta) and signatures (see Figure 2). Actually, when the distributions of parameter values are compared, the values of betweenness, clustering coefficient and connectivity are significantly higher for the reference modules than for co-expression modules or signatures whereas the number of components is significantly lower, which clearly demonstrates the higher network structure of the former with respect to the later (Table 4). The same pattern of significant comparisons is observed when co-expression modules are compared to signatures, which documents a more compact network structure for co-expression modules (Table 4).
Figure 3 shows an example of the PPI networks underlying different modules. The modules represented have been chosen to have about 50 nodes (genes/proteins). Although there are only examples, their network properties are paradigmatic of each type of module. Both, the GO module (regulation of mitotic cell cycle) and the KEGG module (TGF-beta signalling pathway), are highly connected and their connections are wired in a way that the level of betweenness is high. The density of the connections, as represented by the clustering coefficient, is also high in both cases, although superior in the case of the KEGG module. The coexpression modules 115, corresponding to prostate and renal cancers (see http://ai.stanford.edu/~erans/cancer/modules/module_115.html) enriched in genes related to translation activity and protein biosynthesis, and 87, found in hematologic cancers (see http://ai.stanford.edu/~erans/cancer/modules/module_87.html) and enriched in genes of translation activity too, are highly connected and present a high betweenness but in both cases the clustering coefficient is not significantly different from the random expectation. The results obtained for the signatures are unequal. While the signature obtained for genes differentially regulated by gamma interferon  has network properties similar to what was observed for the coexpression modules, in the other extreme, the signature obtained for human adipocites  does not present any significant network property. Table 5 shows the significance of the network parameters of the PPI networks shown in Figure 3. Files S1 and S2 contain the values of the network parameters for all the signatures and coexpression modules analyzed.
The networks have been obtained for different types of modules (GO, KEGG, signatures and co-expression modules). All the networks have been chosen with a similar number of nodes (around 50 genes/proteins). In the networks represented, additional nodes connecting nodes in the lists were allowed. Table 5 shows the significance of the network parameters obtained for the modules. Nodes originally in the list are represented in dark blue and extended nodes in pale blue.
What are co-expression modules and signatures composed of?
Co-expression modules and signatures are supposed to explain to some extent the functional differences between the phenotypes or experimental conditions compared. Functional enrichment analysis is often used to confirm the functional roles of such modules. Here we have carried out an extensive analysis of these modules derived from many experiments to know to what extent this relationship module-function is true and what is the predominant nature of the functionality. To achieve so we have studied the enrichment in both GO terms (by a conventional functional enrichment method ) and PPI (as described in the methods section) in the 665 signatures and 507 co-expression modules used above.
The results are summarized in Figure 4. The first two obvious conclusions are i) co-expression modules are by far more enriched in both functional terms (GO) and network structure than signatures are (82% versus 49%), and ii) both, co-expression modules and signatures are more enriched by functional terms than in network structure. This suggests that co-expression modules are capturing part of the functionality of the cell while signatures fail to do so at the same extent.
The analysis was carried out on 665 signatures and 507 co-expression modules. Different sectors in the pie charts represent the percentages of the cases in which only a GO term was found as significantly over-represented (Only GO), cases in which only some network parameter was significant (Only net), cases in which both GO and net parameters were significant (Net+GO) and cases in which nothing was found as significant.
Although most of the cases significantly enriched in network parameters were also enriched in GO terms there is still a small amount of them (5% of signatures and 4% of co-expression modules) that are exclusively enriched by network structure. It is also remarkable that in a large number of the cases a functional enrichment has been found with no detectable significant network structure.
Conventional functional modules (GO, KEGG or Biocarta) can be considered representatives of cell activity components. It is not surprising, thus, that a relatively large amount of network structure can be detected in them through the corresponding network parameters. Despite the fact that functional modules are not perfectly defined and that the description of the human interactome is far from being definitive  the results obtained provide a quantitative relationship between network structure and functionality. When co-expression modules are analysed, the results show a moderate degree of network structure (although lower than the degree of structure displayed by the conventional functional modules). Finding a certain level of structure, despite moderate, is in agreement with the well known relationship between co-expression and function . The co-expressing gene products of the modules are expected to be located in physical proximity within the cells, most probably in physical contact in many cases , . Actually protein function has been inferred from gene co-expression ,  and protein-protein interactions , ,  data.
When signatures are analysed following the same scheme, the number of those with significant values for network parameters is unexpectedly low. The reasons for this observation are unclear but the low sensitivity of the tests for differential expression  that produces the well known effect of the instability in the signatures  and the questionable reproducibility or results  must probably be among the causes.
It has recently been reported that only about 30% of the modules defined by GO terms and 57% of the modules defined by KEGG pathways display an internal correlation higher than the expected by chance . These proportions fit well with the relative proportions of GO and KEGG with a connection degree higher than the random expectation (Table 1). This fact, in combination with the study of enrichment in functional modules (GO, KEGG and Biocarta) suggests that co-expression modules are capturing the functionality of the cell.
However, signatures seem to provide only an incomplete representation of the functionality of the cell. This is most probably a consequence of the testing strategy used for defining them, which is too conservative . This yields incomplete descriptions of the genes activated and deactivated, resulting on ill defined characterizations of the functions that account for the experiments. It is expectable that, where conventional methods for finding signatures from gene expression data are failing in capturing part of the functional information of the modules, methods based on gene sets ,  and specifically those that consider the structure of the network ,  will produce sounder results.
Materials and Methods
Signatures and co-expression modules
The L2L Microarray Database, accessible through a web portal , contains a collection of results derived from published microarray data. These results are essentially gene signatures and co-expression modules defined by the database curators or directly by the authors of the papers. Every microarray experiment in the collected publications generates lists of genes that are found to be characteristic of some condition or timepoint (see ). Typically, signatures are defined by the application of simple tests such as t-tests or other similar tests (see details in ). A total of 618 signatures defined as genes differentially expressed among a wide range of experimental conditions compared, from human microarray experimental results were downloaded from L2L database . The signatures used here represent the following experimental conditions: 213 cancer, 405 non-cancer, 301 up-regulated, 243 down-regulated. A total of 507 modules of co-expression in cancer, defined as sets of genes co-expressing for a particular set of microarrays, were downloaded from L2L . Co-expression modules have been also downloaded from L2L database , although the original ones can be found in the Module Networks site . Co-expression modules were originally defined by bi-clustering methods (see details in ).
Databases and interactome scaffold generation
The GO database was taken from Ensembl (release 54, May 2009). The KEGG database corresponds to the kegg50 release. Biocarta was downloaded by May 2009.
The program SNOW  (version 1.0) was used for the analyses. SNOW contains a database of PPI generated from the following public repositories: HRPD  (release 7 downloaded 31/03/2009), IntAct  (downloaded 31/03/2009), BIND  (release 2007-05-10), DIP  (release Hsapi20090126) and MINT  (release 2009/02/05). Entries in databases were mapped to Ensembl transcripts and genes. We used this collection of PPI data to generate two different types of interactomes (for both transcripts and genes): a non-filtered scaffold interactome, which include all the available PPIs, and a more confident, filtered scaffold interactome. The six top categories of experimental methods described in the Molecular Interaction Ontology  plus the categories in vivo and in vitro from HPRD were used as confidence measurements. Thus, only PPIs verified by at least two of these categories were considered in the filtered scaffold interactome.
Given a set of gene products, the sub-network defined by them can be easily determined by mapping all the members onto a scaffold interactome.
Calculation of network parameters
Different network parameters represent local and global network properties. Figure 5 schematizes the local properties of the nodes portrayed by the different parameters used. The properties used in this study are: Connection degree, Clustering coefficient, Betweenness centrality and components.
Connection degree was computed as the number of edges (interaction events) for a given node. A shows a node with a high connectivity. B has both high clustering coefficient and connectivity. C has a high betweenness. It is a hub because many shortest paths joining nodes pass through it. The connecting edge between two component (D) is known as the articulation point.
This parameter accounts for the number of partners of direct interaction a particular node has. For a given p, the connection degree is computed as the number of edges (interaction events). Figure 5A shows a node with value of connectivity of 8.0.
This parameter not only accounts for the connectivity of a given node but also for the connectivity of the neighbourhood to which this node is connected. The Clustering coefficient of a node (C(ν)) was obtained by the formula:where en is the number of edges among the nodes connected to node ν, and nν is the number of neighbours of node ν. Figure 5A has the lowest possible clustering coefficient: 0, despite having high connectivity. On the other hand, Figure 5B has both high values of clustering coefficient, C(ν) = 0.6, and connectivity, C = 8.0.
Is related to the concept of hub in a network and the capacity of traversing the network through many alternative paths connecting nodes situated in different extremes. A densely connected network does not necessarily imply many possibilities of traversing it. Betweenness centrality is related to the existence of hubs connecting different parts of the network. Betweenness centrality (CB (ν)) of a node is obtained by applying the formula:being σst(ν), the number of shortest paths through a node and σst, the total number of shortest paths in the graph. The shortest paths among nodes are calculated by Dijkstra algorithm , a widely used algorithm in network analysis. Relative betweenness centrality (rCB (ν)) was calculated as:being n the total number of nodes in the graph. Node C in Figure 5 has a high betweenness given that many shortest paths joining nodes pass through it.
A component in a graph is a group of nodes connected among them. Given a list of nodes connected among them, the minimum connection network (MCN) can be deduced by using the Dijkstra algorithm , which finds shortest the paths among all the nodes. The number of components can easily be added up once the MCN is derived.
PPI network enrichment analysis: Evaluating network parameters in the Minimal Connected Network
The network enrichment analysis consists on testing whether the parameters that describe a network are beyond their random expectations or not. When such parameters are significantly different from what it can be expected just by chance the network can then be considered to be a subset of the interactome enough connected to be considered a real network. The methodology has been previously published  and is briefly described below.
Given a list of nodes (proteins, genes or transcripts), the MCN joining them can easily be derived by mapping the nodes onto the scaffold interactome and finding the shortest paths among all the connected nodes. Thus, connection degree, betweenness centrality and clustering coefficient are parameters that can be measured for each node in the network. Consequently, a distribution for any of these parameters can be obtained for the MCN. Once these distributions are available, a simple Kolmogorov-Smirnov test can be used to check if one or several parameters of the network follow a distribution significantly different from the “random expectation”. The distributions for the “random expectations” of the network parameters of a MCN obtained for N nodes can be constructed by repeating (10,000 times in this case) the following steps: N proteins are randomly sampled from those contained in the reference interactome. They are mapped in the reference interactome and the corresponding MCNRandList is obtained. The network parameters (connection degree, betweenness centrality and clustering coefficient) are used for constructing the corresponding distributions.
Then, the Kolmogorov-Smirnov test can be used to compare the parameter distributions of the MCN obtained from the problem list to their corresponding “random expectations”. The values of the studied parameters for a real sub-network should be significantly higher than the values obtained for the random (and consequently poorly connected) networks.
The number of components of the network can also be tested. This is a simpler case in which the distribution generated can directly be used to build a confidence interval. In this case, the real network should have significantly fewer components than the random network.
Using external nodes
Exactly the same calculations can be performed for an extended MCN. This extension can be attained by using extra nodes, not included in the list of nodes to analyze, that connect two or more nodes in such list. The rationale for this is that often biological systems are poorly characterized and, consequently, lists of interest are not complete. For example, in cases of selection of proteins by expression profiling, non pre-selected proteins have been reported to be related to disease due to its inclusion into a network of PPIs , .The inclusion of such external nodes allows exploring the network space around the MCN and compensate possible nodes that remain undetected in a proteomics or microarray experiment or that remained unnoticed by annotators. This analysis is carried out as follows: for a list of N nodes mapped onto the interactome, all the E nodes that connect any two nodes in the list are found. Then, the MCN joining the N+E nodes is obtained and the corresponding network parameters are calculated. These values are compared by conducting a Kolmogorov-Smirnov test against the corresponding random expectations. The random expectation for a extended network of N nodes is found as follows: N nodes are sampled randomly from the interactome. Then, the Er nodes that connect any of these nodes are added to the random list. Then, the network parameters are calculated for the N+Er nodes. The procedure is repeated 10,000 times to obtain an empirical distribution of the parameters.
Again, the SNOW  program can also be used to calculate all the network parameters for the MCN and for the extended MCN.
Signature parameters. Excel file containing all the signatures analysed with the values of the four network parameters.
- 1. Segal E, Friedman N, Kaminski N, Regev A, Koller D (2005) From signatures to models: understanding cancer using microarrays. Nat Genet 37: SupplS38–45.E. SegalN. FriedmanN. KaminskiA. RegevD. Koller2005From signatures to models: understanding cancer using microarrays.Nat Genet37SupplS3845
- 2. Nadon R, Shoemaker J (2002) Statistical issues with microarrays: processing and analysis. Trends Genet 18: 265–271.R. NadonJ. Shoemaker2002Statistical issues with microarrays: processing and analysis.Trends Genet18265271
- 3. Ein-Dor L, Kela I, Getz G, Givol D, Domany E (2005) Outcome signature genes in breast cancer: is there a unique set? Bioinformatics 21: 171–178.L. Ein-DorI. KelaG. GetzD. GivolE. Domany2005Outcome signature genes in breast cancer: is there a unique set?Bioinformatics21171178
- 4. Allison DB, Cui X, Page GP, Sabripour M (2006) Microarray data analysis: from disarray to consolidation and consensus. Nat Rev Genet 7: 55–65.DB AllisonX. CuiGP PageM. Sabripour2006Microarray data analysis: from disarray to consolidation and consensus.Nat Rev Genet75565
- 5. Stuart JM, Segal E, Koller D, Kim SK (2003) A gene-coexpression network for global discovery of conserved genetic modules. Science 302: 249–255.JM StuartE. SegalD. KollerSK Kim2003A gene-coexpression network for global discovery of conserved genetic modules.Science302249255
- 6. van Noort V, Snel B, Huynen MA (2004) The yeast coexpression network has a small-world, scale-free architecture and can be explained by a simple model. EMBO Rep 5: 280–284.V. van NoortB. SnelMA Huynen2004The yeast coexpression network has a small-world, scale-free architecture and can be explained by a simple model.EMBO Rep5280284
- 7. Wolfe CJ, Kohane IS, Butte AJ (2005) Systematic survey reveals general applicability of “guilt-by-association” within gene coexpression networks. BMC Bioinformatics 6: 227.CJ WolfeIS KohaneAJ Butte2005Systematic survey reveals general applicability of “guilt-by-association” within gene coexpression networks.BMC Bioinformatics6227
- 8. Hartwell LH, Hopfield JJ, Leibler S, Murray AW (1999) From molecular to modular cell biology. Nature 402: C47–52.LH HartwellJJ HopfieldS. LeiblerAW Murray1999From molecular to modular cell biology.Nature402C4752
- 9. Barabasi AL, Oltvai ZN (2004) Network biology: understanding the cell's functional organization. Nat Rev Genet 5: 101–113.AL BarabasiZN Oltvai2004Network biology: understanding the cell's functional organization.Nat Rev Genet5101113
- 10. Kitano H (2002) Computational systems biology. Nature 420: 206–210.H. Kitano2002Computational systems biology.Nature420206210
- 11. Ashburner M, Ball CA, Blake JA, Botstein D, Butler H, et al. (2000) Gene ontology: tool for the unification of biology. The Gene Ontology Consortium. Nat Genet 25: 25–29.M. AshburnerCA BallJA BlakeD. BotsteinH. Butler2000Gene ontology: tool for the unification of biology. The Gene Ontology Consortium.Nat Genet252529
- 12. Kanehisa M, Goto S, Kawashima S, Okuno Y, Hattori M (2004) The KEGG resource for deciphering the genome. Nucleic Acids Res 32: D277–280.M. KanehisaS. GotoS. KawashimaY. OkunoM. Hattori2004The KEGG resource for deciphering the genome.Nucleic Acids Res32D277280
- 13. Biocarta. Biocarta.Available: http://cgap.nci.nih.gov/Pathways/BioCarta_Pathways. Accessed 2011 Jan 7. Available: http://cgap.nci.nih.gov/Pathways/BioCarta_Pathways. Accessed 2011 Jan 7.
- 14. Montaner D, Minguez P, Al-Shahrour F, Dopazo J (2009) Gene set internal coherence in the context of functional profiling. BMC Genomics 10: 197.D. MontanerP. MinguezF. Al-ShahrourJ. Dopazo2009Gene set internal coherence in the context of functional profiling.BMC Genomics10197
- 15. Jansen R, Greenbaum D, Gerstein M (2002) Relating whole-genome expression data with protein-protein interactions. Genome Res 12: 37–46.R. JansenD. GreenbaumM. Gerstein2002Relating whole-genome expression data with protein-protein interactions.Genome Res123746
- 16. Ge H, Liu Z, Church GM, Vidal M (2001) Correlation between transcriptome and interactome mapping data from Saccharomyces cerevisiae. Nat Genet 29: 482–486.H. GeZ. LiuGM ChurchM. Vidal2001Correlation between transcriptome and interactome mapping data from Saccharomyces cerevisiae.Nat Genet29482486
- 17. Brown MP, Grundy WN, Lin D, Cristianini N, Sugnet CW, et al. (2000) Knowledge-based analysis of microarray gene expression data by using support vector machines. Proc Natl Acad Sci U S A 97: 262–267.MP BrownWN GrundyD. LinN. CristianiniCW Sugnet2000Knowledge-based analysis of microarray gene expression data by using support vector machines.Proc Natl Acad Sci U S A97262267
- 18. Mateos A, Dopazo J, Jansen R, Tu Y, Gerstein M, et al. (2002) Systematic learning of gene functional classes from DNA array expression data by using multilayer perceptrons. Genome Res 12: 1703–1715.A. MateosJ. DopazoR. JansenY. TuM. Gerstein2002Systematic learning of gene functional classes from DNA array expression data by using multilayer perceptrons.Genome Res1217031715
- 19. Huynen MA, Snel B, von Mering C, Bork P (2003) Function prediction and protein networks. Curr Opin Cell Biol 15: 191–198.MA HuynenB. SnelC. von MeringP. Bork2003Function prediction and protein networks.Curr Opin Cell Biol15191198
- 20. Vazquez A, Flammini A, Maritan A, Vespignani A (2003) Global protein function prediction from protein-protein interaction networks. Nat Biotechnol 21: 697–700.A. VazquezA. FlamminiA. MaritanA. Vespignani2003Global protein function prediction from protein-protein interaction networks.Nat Biotechnol21697700
- 21. Deng M, Tu Z, Sun F, Chen T (2004) Mapping Gene Ontology to proteins based on protein-protein interaction data. Bioinformatics 20: 895–902.M. DengZ. TuF. SunT. Chen2004Mapping Gene Ontology to proteins based on protein-protein interaction data.Bioinformatics20895902
- 22. Newman JC, Weiner AM (2005) L2L: a simple tool for discovering the hidden significance in microarray expression data. Genome Biol 6: R81.JC NewmanAM Weiner2005L2L: a simple tool for discovering the hidden significance in microarray expression data.Genome Biol6R81
- 23. Al-Shahrour F, Diaz-Uriarte R, Dopazo J (2004) FatiGO: a web tool for finding significant associations of Gene Ontology terms with groups of genes. Bioinformatics 20: 578–580.F. Al-ShahrourR. Diaz-UriarteJ. Dopazo2004FatiGO: a web tool for finding significant associations of Gene Ontology terms with groups of genes.Bioinformatics20578580
- 24. Minguez P, Gotz S, Montaner D, Al-Shahrour F, Dopazo J (2009) SNOW, a web-based tool for the statistical analysis of protein-protein interaction networks. Nucleic Acids Res 37: W109–114.P. MinguezS. GotzD. MontanerF. Al-ShahrourJ. Dopazo2009SNOW, a web-based tool for the statistical analysis of protein-protein interaction networks.Nucleic Acids Res37W109114
- 25. Liu M, Liberzon A, Kong SW, Lai WR, Park PJ, et al. (2007) Network-based analysis of affected biological processes in type 2 diabetes models. PLoS Genet 3: e96.M. LiuA. LiberzonSW KongWR LaiPJ Park2007Network-based analysis of affected biological processes in type 2 diabetes models.PLoS Genet3e96
- 26. Chuang HY, Lee E, Liu YT, Lee D, Ideker T (2007) Network-based classification of breast cancer metastasis. Mol Syst Biol 3: 140.HY ChuangE. LeeYT LiuD. LeeT. Ideker2007Network-based classification of breast cancer metastasis.Mol Syst Biol3140
- 27. Pan KH, Lih CJ, Cohen SN (2005) Effects of threshold choice on biological conclusions reached during analysis of gene expression by DNA microarrays. Proc Natl Acad Sci U S A 102: 8961–8965.KH PanCJ LihSN Cohen2005Effects of threshold choice on biological conclusions reached during analysis of gene expression by DNA microarrays.Proc Natl Acad Sci U S A10289618965
- 28. 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–1094.HK LeeAK HsuJ. SajdakJ. QinP. Pavlidis2004Coexpression analysis of human genes across many microarray data sets.Genome Res1410851094
- 29. Hernandez P, Huerta-Cepas J, Montaner D, Al-Shahrour F, Valls J, et al. (2007) Evidence for systems-level molecular mechanisms of tumorigenesis. BMC Genomics 8: 185.P. HernandezJ. Huerta-CepasD. MontanerF. Al-ShahrourJ. Valls2007Evidence for systems-level molecular mechanisms of tumorigenesis.BMC Genomics8185
- 30. Der SD, Zhou A, Williams BR, Silverman RH (1998) Identification of genes differentially regulated by interferon alpha, beta, or gamma using oligonucleotide arrays. Proc Natl Acad Sci U S A 95: 15623–15628.SD DerA. ZhouBR WilliamsRH Silverman1998Identification of genes differentially regulated by interferon alpha, beta, or gamma using oligonucleotide arrays.Proc Natl Acad Sci U S A951562315628
- 31. Urs S, Smith C, Campbell B, Saxton AM, Taylor J, et al. (2004) Gene expression profiling in human preadipocytes and adipocytes by microarray analysis. J Nutr 134: 762–770.S. UrsC. SmithB. CampbellAM SaxtonJ. Taylor2004Gene expression profiling in human preadipocytes and adipocytes by microarray analysis.J Nutr134762770
- 32. Stumpf MP, Thorne T, de Silva E, Stewart R, An HJ, et al. (2008) Estimating the size of the human interactome. Proc Natl Acad Sci U S A 105: 6959–6964.MP StumpfT. ThorneE. de SilvaR. StewartHJ An2008Estimating the size of the human interactome.Proc Natl Acad Sci U S A10569596964
- 33. Cui X, Churchill GA (2003) Statistical tests for differential expression in cDNA microarray experiments. Genome Biol 4: 210.X. CuiGA Churchill2003Statistical tests for differential expression in cDNA microarray experiments.Genome Biol4210
- 34. Dopazo J (2006) Functional interpretation of microarray experiments. Omics 10: 398–410.J. Dopazo2006Functional interpretation of microarray experiments.Omics10398410
- 35. Goeman JJ, Buhlmann P (2007) Analyzing gene expression data in terms of gene sets: methodological issues. Bioinformatics 23: 980–987.JJ GoemanP. Buhlmann2007Analyzing gene expression data in terms of gene sets: methodological issues.Bioinformatics23980987
- 36. Wei Z, Li H (2007) A Markov random field model for network-based analysis of genomic data. Bioinformatics 23: 1537–1544.Z. WeiH. Li2007A Markov random field model for network-based analysis of genomic data.Bioinformatics2315371544
- 37. Wei P, Pan W (2008) Incorporating gene networks into statistical tests for genomic data via a spatially correlated mixture model. Bioinformatics 24: 404–411.P. WeiW. Pan2008Incorporating gene networks into statistical tests for genomic data via a spatially correlated mixture model.Bioinformatics24404411
- 38. The L2L Microarray Database. The L2L Microarray Database.Available: http://depts.washington.edu/l2l/database.html. Accessed 2011 Jan 7. Available: http://depts.washington.edu/l2l/database.html. Accessed 2011 Jan 7.
- 39. The co-expression cancer modules database. The co-expression cancer modules database.Available: http://ai.stanford.edu/~erans/cancer/index.html. Accessed 2011 Jan 7. Available: http://ai.stanford.edu/~erans/cancer/index.html. Accessed 2011 Jan 7.
- 40. Segal E, Friedman N, Koller D, Regev A (2004) A module map showing conditional activity of expression modules in cancer. Nat Genet 36: 1090–1098.E. SegalN. FriedmanD. KollerA. Regev2004A module map showing conditional activity of expression modules in cancer.Nat Genet3610901098
- 41. Peri S, Navarro JD, Amanchy R, Kristiansen TZ, Jonnalagadda CK, et al. (2003) Development of human protein reference database as an initial platform for approaching systems biology in humans. Genome Res 13: 2363–2371.S. PeriJD NavarroR. AmanchyTZ KristiansenCK Jonnalagadda2003Development of human protein reference database as an initial platform for approaching systems biology in humans.Genome Res1323632371
- 42. Kerrien S, Alam-Faruque Y, Aranda B, Bancarz I, Bridge A, et al. (2007) IntAct–open source resource for molecular interaction data. Nucleic Acids Res 35: D561–565.S. KerrienY. Alam-FaruqueB. ArandaI. BancarzA. Bridge2007IntAct–open source resource for molecular interaction data.Nucleic Acids Res35D561565
- 43. Bader GD, Betel D, Hogue CW (2003) BIND: the Biomolecular Interaction Network Database. Nucleic Acids Res 31: 248–250.GD BaderD. BetelCW Hogue2003BIND: the Biomolecular Interaction Network Database.Nucleic Acids Res31248250
- 44. Salwinski L, Miller CS, Smith AJ, Pettit FK, Bowie JU, et al. (2004) The Database of Interacting Proteins: 2004 update. Nucleic Acids Res 32: D449–451.L. SalwinskiCS MillerAJ SmithFK PettitJU Bowie2004The Database of Interacting Proteins: 2004 update.Nucleic Acids Res32D449451
- 45. Chatr-aryamontri A, Ceol A, Palazzi LM, Nardelli G, Schneider MV, et al. (2007) MINT: the Molecular INTeraction database. Nucleic Acids Res 35: D572–574.A. Chatr-aryamontriA. CeolLM PalazziG. NardelliMV Schneider2007MINT: the Molecular INTeraction database.Nucleic Acids Res35D572574
- 46. Hermjakob H, Montecchi-Palazzi L, Bader G, Wojcik J, Salwinski L, et al. (2004) The HUPO PSI's molecular interaction format–a community standard for the representation of protein interaction data. Nat Biotechnol 22: 177–183.H. HermjakobL. Montecchi-PalazziG. BaderJ. WojcikL. Salwinski2004The HUPO PSI's molecular interaction format–a community standard for the representation of protein interaction data.Nat Biotechnol22177183
- 47. Dijkstra E (1959) A note on two problems in connexion with graphs. Numerische Mathematik 1: 269–271.E. Dijkstra1959A note on two problems in connexion with graphs.Numerische Mathematik1269271
- 48. Medina I, Carbonell J, Pulido L, Madeira SC, Goetz S, et al. (2010) Babelomics: an integrative platform for the analysis of transcriptomics, proteomics and genomic data with advanced functional profiling. Nucleic Acids Res 38: SupplW210–213.I. MedinaJ. CarbonellL. PulidoSC MadeiraS. Goetz2010Babelomics: an integrative platform for the analysis of transcriptomics, proteomics and genomic data with advanced functional profiling.Nucleic Acids Res38SupplW210213