Skip to main content
Download PDF

Volume 12 Supplement 13

Tenth International Conference on Bioinformatics. First ISCB Asia Joint Conference 2011 (InCoB/ISCB-Asia 2011): Bioinformatics

Finding consistent disease subnetworks across microarray datasets

BMC Bioinformatics volume 12, Article number: S15 (2011) Cite this article

Abstract

Background

While contemporary methods of microarray analysis are excellent tools for studying individual microarray datasets, they have a tendency to produce different results from different datasets of the same disease. We aim to solve this reproducibility problem by introducing a technique (SNet). SNet provides both quantitative and descriptive analysis of microarray datasets by identifying specific connected portions of pathways that are significant. We term such portions within pathways as “subnetworks”.

Results

We tested SNet on independent datasets of several diseases, including childhood ALL, DMD and lung cancer. For each of these diseases, we obtained two independent microarray datasets produced by distinct labs on distinct platforms. In each case, our technique consistently produced almost the same list of significant nontrivial subnetworks from two independent sets of microarray data. The gene-level agreement of these significant subnetworks was between 51.18% to 93.01%. In contrast, when the same pairs of microarray datasets were analysed using GSEA, t-test and SAM, this percentage fell between 2.38% to 28.90% for GSEA, 49.60% tp 73.01% for t-test, and 49.96% to 81.25% for SAM. Furthermore, the genes selected using these existing methods did not form subnetworks of substantial size. Thus it is more probable that the subnetworks selected by our technique can provide the researcher with more descriptive information on the portions of the pathway actually affected by the disease.

Conclusions

These results clearly demonstrate that our technique generates significant subnetworks and genes that are more consistent and reproducible across datasets compared to the other popular methods available (GSEA, t-test and SAM). The large size of subnetworks which we generate indicates that they are generally more biologically significant (less likely to be spurious). In addition, we have chosen two sample subnetworks and validated them with references from biological literature. This shows that our algorithm is capable of generating descriptive biologically conclusions.

Background

There is a wealth of techniques for identifying significant differential gene expression. These techniques can be categorized into three approaches; viz., individual genes, gene pathways and gene classes approaches.

• Individual genes

These techniques search for individual genes that are differentially expressed. For example, the fold change, t-test and Significance Analysis of Microarrays (SAM) [1]. The output of such algorithms is a list of genes that are deemed differentially expressed.

• Gene pathway deduction

Methods of this genre attempt to infer biological information from data without using pre-existing biological information. Bayesian learning [2] and Boolean network learning [3] are representatives of this approach. The researcher will obtain a set of gene networks connected and inferred solely from the gene expression data.

• Gene classes

These techniques test how gene classes behave as a whole. These techniques either pre-process or post-process their information with existing biological background knowledge to guide their analysis of the microarray data. Examples include over-representation analysis (ORA) [4], Functional Class Scoring (FCS) [5], GSEA [6], NEA [7] and ErmineJ [8]. Results from such methods are normally a list of pathways or gene groups that are differentially expressed according to the algorithms.

The commonly acknowledged challenge of these techniques is obtaining reproducible results. For instance, in differentially expressed gene discovery, there should be a substantial overlap in the gene lists from different datasets of the same disease. This is inferred from the premise that similar underlying conditions cause the onset of certain diseases. However it has been shown that there is little concurrence among such gene lists [9–11].

For example, [11] demonstrated this inconsistency using SAM. For a pair of datasets involving prostate cancer [12, 13], he calculated the percentage overlap of differentially expressed genes between them. The top 10 genes had a percentage overlap of 30% while the top 100 genes had a percentage overlap of 15%. The same calculations were repeated for lung cancer [14, 15] and DMD [16, 17] datasets, yielding similar low percentages.

In addition, the functional gene lists, pathways or classes determined by such methods do not provide sufficient descriptive information about the interplay and relationship of genes [18]. Hence the generated hypotheses are usually too general, rendering them ineffective in guiding further research and treatment [19].

In this article we present our technique, SNet, to identify subnetworks which are expressed significantly within a phenotype of a microarray experiment. Furthermore, we demonstrate the consistency—and thus reproducibility—of the identified subnetworks by achieving a high overlap (51.18% to 93.01%) between significantly differentially expressed genes (found within the identified subnetworks) of different microarray experiments of the same disease. Finally, we show that the significant genes found by t-test/GSEA formed much smaller subnetworks (<5 genes) than ours. These experiments demonstrate the consistency, reproducibility, descriptive power, interpretability and significance of subnetworks obtained using our technique.

Approach

We hypothesize that specific biological processes within pathways are relevant to specific diseases. Thus our approach concentrates on identifying these biological processes that we termed “subnetworks”. These subnetworks should be largely the same across independent datasets of the same disease. Because the probability of such a subnetwork of highly expressed genes randomly occurring is sufficiently low, we are able to conclude that these subnetworks have a strong biological relevance with respect to the disease. Furthermore, such a subnetwork provides intricate information on the interplay and relationship between the genes, which will be advantageous in guiding subsequent research. This technique also removes sporadic genes that appear solitary within a biological pathway (because of their higher possibility of being a false positive).

We define the term “subnetwork” as “a set of genes and relationships where all genes in the subnetwork are reachable by all other genes in the (undirected) subnetwork. Reachability between genes is established by the existence of an undirected path between the genes of the subnetwork.” This is analogous to the definition of “connected components” in graph theory [20].

Only two types of gene-gene relationships are considered: inhibition and activation. This information regarding the relationship of two genes within a pathway is already inherent within the database and our goal is to find out if the microarray data complies with these relationships. In the example in Figure 1, we see the genes ATM, CHK1, CHK2 and MDM2 with the relationships: ATM activating CHK1, CHK2 and MDM2 inhibiting p53. Thus we define the term “relationship” between a pair of genes X and Y as a situation where either X “activates” Y or X “inhibits” Y.

Figure 1
figure 1

Example of the two gene-gene relationships. Example of the two gene-gene relationships. Left: an activating relationship between ATM and CHK1. Right: an inhibiting relationship between MDM2 and p53.

Full size image

Because of the fine granularity of analysis, the pathway repository must allow us to easily segregate the original microarray data into its relevant pathways, gene relationships and subnetworks. Due to the large amount of data, the pathway repository must also facilitate the development of automated analysis workflows. The repository therefore is required to have the following characteristics:

  • Gene annotations have to be consistent with that in microarray experiments.

  • Individual gene relationships within pathways have to be provided.

  • The database must have a programmatic interface to access the data.

This set of criteria eliminates contemporary pathway sources such as Ingenuity [21], BioPax [22], and GenMapp [23], and we are left with KEGG. However, KEGG has a number of limitations. Firstly, its collection of pathways is not sufficiently comprehensive [24]. For example, our analysis [25] shows that 78.8% of pathways in Ingenuity and 64.4% of pathways in Wikipathways are not contained in KEGG. Secondly, KEGG still uses an old-fashioned SOAP/XML interface. So we developed PathwayAPI [25] which offered the combined pathway information of KEGG, Ingenuity, and Wikipathways along with a modern JSON-based application programming interface.

Our technique (to be described later) was applied on the disease types listed below with two different datasets analyzed independently for each disease type. The selection of the two datasets for each disease is because they were used to compare gene selection methods in earlier papers [11]. In addition, the two datasets for each disease type are from different platforms, thus providing a more stringent test as they make it harder for the gene selection algorithms to consistently select the same genes independently from the two datasets.

  • Leukaemia: Comparison between leukaemia subtypes ALL and AML. Golub et al. [26] uses the Affymetrix HU6800 GeneChip with 47 ALL and 25 AML patients. Armstrong et al. [27] uses the Affymetrix HG-U95Av2 GeneChip with 24 ALL patients and 24 AML patients.

  • Childhood Acute Lymphoblastic Leukaemia (ALL) Subtype: Comparison between two subtypes of childhood ALL leukaemia, namely E2A-PBX1 and BCR-ABL. Ross et al. [28]) uses the Affymetrix HG-U95Av2 GeneChip with 15 BCR-ABL patients and 27 E2A-PBX1 patients. Yeoh et al. [29] uses the U133A GeneChip with 15 BCR-ABL patients and 18 E2A-PBX1 patients.

  • Duchenne Muscular Dystrophy (DMD): Comparison between patients suffering from DMD and normal patients. Haslett et al. [17] uses the Affymetrix HG-U95Av2 GeneChip while Pescator et al. [16] uses HG-U133A GeneChip. Haslett et al.’s dataset contains 24 samples from 12 DMD patients and 12 unaffected controls and Pescatori et al.’s consists of 36 samples from 22 DMD patients and 14 controls.

  • Lung Cancer (Squamous): Comparison between patients suffering from squamous cell lung carcinomas and normal patients. For lung cancer, the cDNA microarray data consists of 13 samples with squamous cell lung carcinomas and five normal lung specimens [14], while the data by Affymetrix human U95A oligonucleotide arrays consist of 21 squamous cell lung carcinomas and 17 normal lung specimens [15].

Results and discussion

Significant subnetworks overlap

For each disease, two lists of significant subnetworks were identified by applying our technique (SNet) independently on the two different datasets for the disease. We next calculate the percentage overlap between the two lists of significant subnetworks.

This result is compared with another algorithm (GSEA) that extracts significant gene lists from microarray data. The individual pathways from the database (PathwayAPI [25], 386 pathways in total) and their associated genes are used as input gene sets for GSEA. Hence running GSEA with this database of pathways gives us a selected set of pathways deemed as significant by GSEA. GSEA is applied to both datasets of the same disease. For each dataset, we obtain a list of pathways significantly expressed and remove the pathways whose FDR q-value falls below 0.25. Finally, we calculate the percentage intersection between the remaining pathways within these two lists.

Results indicate that our technique consistently gives a higher percentage overlap for different datasets of the same disease than GSEA. Here, our technique obtained a high overlap percentage for these datasets (47.63% to 90.90%). As an example from Table 1, the percentage overlap of pathways in determining the ALL Subtype (second row in the table) in SNet is 47.63% while that for GSEA is 23.1%. The full results can be observed in Table 1. Table 2 shows the number of overlapping significant pathways for each disease type.

Table 1 Percentage overlap significant subnetworks between the datasets
Full size table
Table 2 Number of overlap significant subnetworks between the datasets
Full size table

Significant genes overlap

To demonstrate that the genes within the subnetworks are consistent across the datasets of the same disease, we obtained independently a list of significant genes from each dataset using SNet, GSEA, SAM and the t-test. After which we would calculate the percentage overlap between the same disease of each dataset. Results demonstrate that our SNet algorithm has a much higher overlap percentage as compared to the other techniques surveyed.

For SNet, we select the significant genes from each dataset by simply taking the genes from the subnetworks generated from each dataset. (As there are two independent datasets for each disease type, we generate two gene lists for each disease type. We denote the number of genes in the smaller list as γ). For GSEA, we obtain the list of significant genes by first selecting the top γ number of leading edge set of genes from the well expressed pathways for each dataset. The lists of significant genes for SAM and t-test are obtained by selecting all the genes with a p-value less than 0.05, as well as by selecting the top γ significant genes. The results shown in Table 3, Table 4 and Table 5 show that the gene overlap obtained from GSEA, t-test and SAM are consistently and significantly lower (2.38% to 28.90% for GSEA, 49.60% to 73.01% for t-test, 49.96% to 81.25% for SAM) compared to that of SNet (51.18% to 93.01%).

Table 3 Number and percentage of overlap genes
Full size table
Table 4 Number and percentage of significant overlap genes with t-test
Full size table
Table 5 Number and percentage of significant overlap genes with SAM
Full size table

Size of subnetworks

This section shows that the size of the subnetworks obtained by our algorithm is significantly larger than those obtained from the t-test algorithm. We first obtain a ranked gene list for each dataset using the t-test algorithm. Assuming once again that the total number of genes present within the significant subnetworks for a dataset i is δ i , we extract the top δ i genes from the ranked gene list for each dataset i. Lastly, we calculate the size of the subnetworks formed by these top δ i genes. We compare these sizes with subnetworks formed by SNet. The results in Table 6 show that the subnetworks obtained by SNet are large (which always contain at least 5 genes and many contain more than 8 genes), while subnetworks obtained by the t-test are small in size (which generally contain 2 or 3 genes and are always no more than 5 genes).

Table 6 Size of largest subnetworks from t-test
Full size table

Validity of genes within each subnetwork

To check the validity of the subnetworks selected, we compare the genes present within each subnetwork with those deemed significant by the t-test. A high percentage would mean that the genes within our captured subnetworks are highly consistent to established methods such as t-test, yet at the same time rejecting genes that are non-consistent over datasets (hence likely to be false positives). Table 7, 8, 9, Table 10 show the different subnetworks found significant within their respective disease sets. The corresponding percentage depicts the percentage of genes present within the subnetwork which are also significant by the t-test (taken with a p-value threshold of 0.05). We can observe from the tables that the bulk of the subnetworks have a high consistency percentage, falling between 70% to 100%.

Table 7 Percentage of genes from subnetworks for the leukaemia dataset which are also considered significant by t-test
Full size table
Table 8 Percentage of genes from subnetworks for the ALL subtype which are also considered significant by t-test
Full size table
Table 9 Percentage of genes from subnetworks for the DMD dataset which are also considered significant by t-test
Full size table
Table 10 Percentage of genes from subnetworks for the lung dataset which are also considered significant for the t-test
Full size table

Biological relevance of subnetworks

Two small sample subnetworks are chosen here to show the biological significance of the results obtained. The first which we describe below (and in Figure 2) is generated from the leukaemia dataset. The genes within this subnetwork are very substantially supported by literature with respect to their role in leukaemia. For instance, the gene RAC (which regulates a diverse array of cellular events) is referenced in [30, 31] as having an effect on leukaemia. Other genes within the network are Rhoa (regulates the actin cytoskeleton in formation of stress fibers) in [32, 33], Vav1 (plays a major role in development and activation of T-cell and B-cell blood cells) in [34] and IQGAP (regulates cell adhesion, morphology and motility) in [35].

Figure 2
figure 2

Sample subnetwork from leukaemia dataset. A sample subnetwork from leukaemia dataset [26, 27].

Full size image

The next subnetwork shown in Figure 3 is generated from the DMD disease datasets, and is taken from the Apoptosis pathway. Results from our algorithm indicated that the genes groups MYL and MYH are significantly differentiately expressed between the DMD patients and the normal patients. MYH (myosin, heavy chain) and MYL (myosin, light chain) are known to be major gene groups involved in release of mechanical energy allowing muscles to contract. These genes are heavily quoted in literature with regard to their involvement in the disease DMD: MYH3 and MYH8 [17], MYH6 [36], MYH7 [37], MYL1, MYL2, MYL3, MYL4, MYL5, MYL6 and MYL9 [36]. In addition, the gene titin was identified. Titin is a gene which encodes a large protein of the spinal skeletal muscles and its mutation is widely found to occur in various types of muscular dystropy [38–41].

Figure 3
figure 3

Sample subnetwork from leukaemia database. A sample subnetwork from DMD dataset [16, 17].

Full size image

Conclusions

Microarray experiments are crucial because they measure the behaviour of individual genes with respect to diseases or treatments. Results from these experiments are heavily scrutinised to obtain biological insights into the occurrence of diseases or the effectiveness of certain types of treatments. In order to provide more indepth analysis to experiments, contemporary algorithms have incorporated biological information into their analysis so that the analysis can be more descriptive and hopefully useful to the researchers. Our techniques have taken this approach one step further. Firstly, we no longer consider prior biological knowledge as a separate aspect of microarray analysis. Rather, we take into account the integrity of the biological information that is being provided into the algorithm for analysis. Secondly, our algorithm uses both the gene-gene interaction information and pathway information in our analysis. Because of these two enhancements, we are able to generate subnetworks in real-time according to the responses of the microarray experiments. These contributions help us avoid some of the potential caveats present within microarray experiments.

We are certainly not the first to integrate gene-expression data with gene-gene relationships. GNEA [42] is one such example. GNEA uses a global protein-protein interaction network, finds subnetworks that correspond to regions of significantly differentially expressed genes; these subnetworks are called HSNs in the paper. GNEA then determines which gene sets in a library of gene sets are significantly enriched in HSNs. There are two possible shortcomings in this approach. Firstly, in using a single global protein interaction network, GNEA makes the biological assumption that the local behaviour of proteins can be translated in a similar fashion globally and that gene expression levels are in a tight correspondence to protein levels (which is not generally true). A similar issue is raised in [7] where the authors argued that proteins which are very well connected have an extremely high chance of obtaining a low p-value and being ranked as significant. Because of the high connectivity of such proteins, they are liable to be involved in various disjoint biological processes, leading to the error of combining independent subnetworks through these proteins. To prevent such scenarios, we instead implemented our algorithm via identifying localised gene-gene subnetworks within pathways. Secondly, while a gene set that is significantly enriched in HSNs is likely to be relevant, a large gene set may not be found significantly enriched in HSNs even though it may have contained a subset that is significantly enriched. This is also an issue that we find in GSEA.

We obtain a low result overlap from GSEA possibly because the pathways from PathwayApi are very large and GSEA relies on a large portion of a pathway to exhibit a correlated change. Hence when only a subset of a pathway demonstrates differential expression, GSEA may be unable to pick this up. We verified this hypothesis by feeding into GSEA subnetworks that we found from our algorithm into the leukaemia datasets. Indeed GSEA was then able to obtain significant subnetworks that overlapped.

In addition, we show that our technique generates significant subnetworks and genes that are more consistent across datasets compared to the other popular methods available (GSEA, t-test and SAM). The large size of subnetworks which we generate indicates that they are generally more biologically significant (less likely to be spurious). To validate our results, we show that most of our genes from the generated subnetworks have also been considered significant by the t-test. In addition, we have chosen two sample subnetworks and validated them with references from biological literature. This shows that our algorithm is capable of generating descriptive biologically conclusions.

Our final contribution lies in our ability to create connected components (of known pathways) in real time based on microarray data. This allows us to obtain connected components according to the microarray data. Both GNEA and GSEA use fixed gene sets and determines if these gene sets are significant or not. These techniques assume that a gene set is significant only if a substantial proportion of the genes within the gene set is significant. This assumption might not be valid because there are instances where only part of a gene set becomes significant; and it would probably go unnoticed if most of the rest of the genes are unaffected. Our ability to create connected components based on the microarray data of the phenotypes—and use these as gene sets—ensures that we have sufficient granularity to capture portions of pathways or gene sets that are affected.

Methods

Overview Let the phenotype of interest be d and the remaining phenotypes be labelled as ¬d. We first extract genes which are highly expressed within this phenotype d from the microarray experiment. This set of genes is next segregated into their respective subnetworks using apriori biological information from the pathway repository [25]. This gives us a list of subnetworks cc (whose genes are highly expressed) within d. A score (depending on the size of the subnetwork and its consistency among the patients) is next calculated and assigned to each subnetwork. Finally we estimate the p-value of every single subnetwork within the list and keep those which are significant. This is elaborated in the following steps:

Step 1: Subnetwork extraction We create a ranked gene list for each patient within a phenotype according to the gene expression level of that patient. From this ranked gene list we extract only the top α% of genes for each patient. This condensed gene list is referred to as G P i for the ith patient P i . We next iterate across gene lists G P i only for patients of phenotype d, extracting only genes which appear in more than β% of the patients of phenotype d. This creates a list of genes GL which turns up highly expressed across most of the patients of phenotype d. Finally, using the programmatic interface of PathwayAPI, gene list GL is segregated into the respective subnetworks. In our experiments, α is taken to be 10 and β to be 50.

To segregate GL into the different subnetworks, we first split gene list GL into its pathways and the gene-gene relationships within these pathways. (We highlight that a gene is allowed to appear in more than one pathway.) Next, by treating each gene as a vertex and each gene-gene relationship as an edge, we can easily locate the connected components (subnetworks) formed by these edges (gene-gene relationships) and vertices (genes) in each pathway. This process is illustrated in Figure 4.

Figure 4
figure 4

Sample subnetwork formation. An example of how we form subnetworks from a sample pathway with its genes.

Full size image

Step 2: Subnetwork scoring For each subnetwork sp within cc and for each patient P i (regardless of phenotype), we compute the overall expression level of sp in P i by

(1)

Here, g denotes a gene in the subnetwork sp that is highly expressed (top α%) in patient P i ; k is the number of patients of phenotype d who have gene g highly expressed (top α%); and n is the total number of patients of phenotype d.

Let P1, …, P n be patients of phenotype d; and P n +1, …, P m be patients of other phenotypes ¬d. We assign two score vectors Ssp sp , d and Sspsp,¬d respectively for these two groups of patients, where

(2)

The t-statistics is now calculated between these two vectors, creating a final score for each subnetwork sp within cc. We call this score Ssp sp , t .

Step 3: Subnetwork significance We repeat Steps 1 and 2 for all the phenotypes in the dataset to extract a list of subnetworks SN. The significance of the observed subnetworks is estimated by randomly permuting the phenotypes labels, re-extracting the subnetworks and recomputing their t-statistics scores. This generates a null distribution for the score and size of the subnetworks. The p-value of each subnetwork is then calculated relative to this null distribution. The null hypothesis being that for a subnetwork obtained of size |sp| and score Sspsp,t, the subnetwork is not significant. An example of such a distribution is seen in Figure 5. In detail, the procedure is as follows:

Figure 5
figure 5

Sample null distribution of subnetworks according to the size and score.

Full size image

A Randomly swap the phenotype labels of the patients, recreating the subnetworks and recalculating their t-statistics scores.

B Repeat [A] for 1,000 permutations. This creates a two dimensional histogram of the scores and sizes of the subnetworks.

C Estimate the nominal p-value of each subnetwork by using the histogram created in point [B].

Finally, we consider subnetworks whose p-value was sufficiently small (≤ 0.05) to be significant. Doing so would provide us with an independent set of significant subnetworks SN for each dataset. Using our algorithm, we have managed to show that we are able to obtain consistent significant subnetworks across different datasets of the same disease.

References

  1. Tusher VG, Tibshirani R, Chu G: Significance analysis of microarrays applied to the ionizing radiation response. Proc Natl Acad Sci U S A 2001, 98(9):5116–5121. [http://dx.doi.org/10.1073/pnas.091062498] 10.1073/pnas.091062498

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  2. Friedman N, Linial M, Nachman I, Pe’er D: Using Bayesian networks to analyze expression data. J Comput Biol 2000, 7(3–4):601–620. [http://dx.doi.org/10.1089/106652700750050961] 10.1089/106652700750050961

    Article  CAS  PubMed  Google Scholar 

  3. Lähdesmäki H, Hautaniemi S, Shmulevich I, Yli-Harja O: Relationships between probabilistic Boolean networks and dynamic Bayesian networks as models of gene regulatory networks. Signal Process 2006, 86(4):814–834. 10.1016/j.sigpro.2005.06.008

    Article  Google Scholar 

  4. Khatri P, Draghici S: Ontological analysis of gene expression data: current tools, limitations, and open problems. Bioinformatics 2005, 21(18):3587–3595. [http://bioinformatics.oxfordjournals.org/cgi/content/abstract/21/18/3587] 10.1093/bioinformatics/bti565

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  5. Goeman JJ, van de Geer SA, de Kort F, van Houwelingen HC: A global test for groups of genes: testing association with a clinical outcome. Bioinformatics 2004, 20: 93–99. [http://bioinformatics.oxfordjournals.org/cgi/content/abstract/20/1/93] 10.1093/bioinformatics/btg382

    Article  CAS  PubMed  Google Scholar 

  6. Subramanian A, Tamayo P, Mootha VK, Mukherjee S, Ebert BL, Gillette MA, Paulovich A, Pomeroy SL, Golub TR, Lander ES, Mesirov JP: Gene set enrichment analysis: A knowledge-based approach for interpreting genome-wide expression profiles. Proceedings of the National Academy of Sciences of the United States of America 2005, 102(43):15545–15550. [http://www.pnas.org/content/102/43/15545.abstract] 10.1073/pnas.0506580102

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  7. Sivachenko AY, Yuryev A, Daraselia N, Mazo I: Molecular Networks in microarray Analysis. J. Bioinformatics and Computational Biology 2007, 5(2b):429–456. 10.1142/S0219720007002795

    Article  CAS  PubMed  Google Scholar 

  8. Pavlidis P, Qin J, Arango V, Mann JJ, Sibille E: Using the Gene Ontology for Microarray Data Mining: A Comparison of Methods and Application to Age Effects in Human Prefrontal Cortex. Neurochemical Research 2004, 29(6):1213–1222. [http://dx.doi.org/10.1023/B:NERE.0000023608.29741.45]

    Article  CAS  PubMed  Google Scholar 

  9. Ein-Dor L, Kela I, Getz G, Givol D, Domany E: Outcome signature genes in breast cancer: is there a unique set? Bioinformatics 2005, 21(2):171–178. [http://bioinformatics.oxfordjournals.org/cgi/content/abstract/21/2/171] 10.1093/bioinformatics/bth469

    Article  CAS  PubMed  Google Scholar 

  10. Michiels S, Koscielny S, Hill C: Prediction of cancer outcome with microarrays: a multiple random validation strategy. The Lancet 2005, 365(9458):488–492. [http://dx.doi.org/10.1016/S0140–6736(05)17866–0] 10.1016/S0140-6736(05)17866-0

    Article  CAS  Google Scholar 

  11. Zhang M, Zhang L, Zou J, Yao C, Xiao H, Liu Q, Wang J, Wang D, Wang C, Guo Z: Evaluating reproducibility of differential expression discoveries in microarray studies by considering correlated molecular changes. Bioinformatics 2009, 25(13):1662–1668. [http://bioinformatics.oxfordjournals.org/cgi/content/abstract/25/13/1662] 10.1093/bioinformatics/btp295

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  12. Lapointe J, Li C, Higgins JP, van de Rijn M, Bair E, Montgomery K, Ferrari M, Egevad L, Rayford W, Bergerheim U, Ekman P, DeMarzo AM, Tibshirani R, Botstein D, Brown PO, Brooks JD, Pollack JR: Gene expression profiling identifies clinically relevant subtypes of prostate cancer. Proceedings of the National Academy of Sciences of the United States of America 2004, 101(3):811–816. [http://www.pnas.org/content/101/3/811.abstract] 10.1073/pnas.0304146101

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  13. Singh D, Febbo PG, Ross K, Jackson DG, Manola J, Ladd C, Tamayo P, Renshaw AA, D’Amico AV, Richie JP, Lander ES, Loda M, Kantoff PW, Golub TR, Sellers WR: Gene expression correlates of clinical prostate cancer behavior. Cancer Cell 2002, 1: 203–9. [http://www.ncbi.nlm.nih.gov/pubmed/12086878] 10.1016/S1535-6108(02)00030-2

    Article  CAS  PubMed  Google Scholar 

  14. Garber ME, Troyanskaya OG, Schluens K, Petersen S, Thaesler Z, Pacyna-Gengelbach M, van de Rijn M, Rosen GD, Perou CM, Whyte RI, Altman RB, Brown PO, Botstein D, Petersen I: Diversity of gene expression in adenocarcinoma of the lung. Proceedings of the National Academy of Sciences of the United States of America 2001, 98(24):13784–13789. [http://www.pnas.org/content/98/24/13784.abstract] 10.1073/pnas.241500798

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  15. Bhattacharjee A, Richards WG, Staunton J, Li C, Monti S, Vasa P, Ladd C, Beheshti J, Bueno R, Gillette M, Loda M, Weber G, Mark EJ, Lander ES, Wong W, Johnson BE, Golub TR, Sugarbaker DJ, Meyerson M: Classification of human lung carcinomas by mRNA expression profiling reveals distinct adenocarcinoma subclasses. Proceedings of the National Academy of Sciences of the United States of America 2001, 98(24):13790–13795. [http://www.pnas.org/content/98/24/13790.abstract] 10.1073/pnas.191502998

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  16. Pescatori M, Broccolini A, Minetti C, Bertini E, Bruno C, D’amico A, Bernardini C, Mirabella M, Silvestri G, Giglio V, Modoni A, Pedemonte M, Tasca G, Galluzzi G, Mercuri E, Tonali PA, Ricci E: Gene expression profiling in the early phases of DMD: a constant molecular signature characterizes DMD muscle from early postnatal life throughout disease progression. FASEB J 2007, 21(4):1210–1226. [http://www.fasebj.org/cgi/content/abstract/21/4/1210] 10.1096/fj.06-7285com

    Article  CAS  PubMed  Google Scholar 

  17. Haslett JN, Sanoudou D, Kho AT, Bennett RR, Greenberg SA, Kohane IS, Beggs AH, Kunkel LM: Gene expression comparison of biopsies from Duchenne muscular dystrophy (DMD) and normal skeletal muscle. Proceedings of the National Academy of Sciences of the United States of America 2002, 99(23):15000–15005. [http://www.pnas.org/content/99/23/15000.abstract] 10.1073/pnas.192571199

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  18. Soh D, Dong D, Guo Y, Wong L: Enabling more sophisticated gene expression analysis for understanding diseases and optimizing treatments. ACM SIGKDD Explorations 2007, 9: 3–14.

    Article  Google Scholar 

  19. Dong D, Cui CY, Mow B, Wong L: Deciphering Drug Action and Escape Pathways: An Example on Nasopharyngeal Carcinoma. In BICoB ’09: Proceedings of the 1st International Conference on Bioinformatics and Computational Biology. Berlin, Heidelberg: Springer-Verlag; 2009:199–210.

    Chapter  Google Scholar 

  20. Cormen TH, Leiserson CE, Rivest RL, Stein C: Introduction to Algorithms. MIT Press and McGraw-Hill; 2001.

    Google Scholar 

  21. Ingenuity Systems1998. [http://www.ingenuity.com/]

  22. Kotecha N, Bruck K, Lu W, Shah N: Pathway knowledge base: An integrated pathway resource using BioPAX. Appl. Ontol 2008, 3(4):235–245.

    Google Scholar 

  23. Salomonis N, Hanspers K, Zambon AC, Vranizan K, Lawlor SC, Dahlquist KD, Doniger SW, Stuart J, Conklin BR, Pico AR: GenMAPP 2: new features and resources for pathway analysis. BMC bioinformatics 2007, 8: 217+. [http://dx.doi.org/10.1186/1471–2105–8-217] 10.1186/1471-2105-8-217

    Article  PubMed Central  PubMed  Google Scholar 

  24. Green ML, Karp PD: The outcomes of pathway database computations depend on pathway ontology. Nucl. Acids Res 2006, 34(13):3687–3697. [http://nar.oxfordjournals.org/cgi/content/abstract/34/13/3687] 10.1093/nar/gkl438

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  25. Soh D, Dong D, Guo Y, Wong L: Consistency, Comprehensiveness and Compatibility of Pathway Databases. BMC Bioinformatics 2010, 11: 449. 10.1186/1471-2105-11-449

    Article  PubMed Central  PubMed  Google Scholar 

  26. Golub TR, Slonim DK, Tamayo P, Huard C, Gaasenbeek M, Mesirov JP, Coller H, Loh ML, Downing JR, Caligiuri MA, Bloomfield CD, Lander ES: Molecular Classification of Cancer: Class Discovery and Class Prediction by Gene Expression Monitoring. Science 1999, 286(5439):531–537. [http://dx.doi.org/10.1126/science.286.5439.531] 10.1126/science.286.5439.531

    Article  CAS  PubMed  Google Scholar 

  27. Armstrong SA, Staunton JE, Silverman LB, Pieters R, den Boer ML, Minden MD, Sallan SE, Lander ES, Golub TR, Korsmeyer SJ: MLL translocations specify a distinct gene expression profile that distinguishes a unique leukemia. Nature Genetics 2002, 30: 41–7. [http://www.ncbi.nlm.nih.gov/pubmed/11731795] 10.1038/ng765

    Article  CAS  PubMed  Google Scholar 

  28. Ross ME, Mahfouz R, Onciu M, Liu HC, Zhou X, Song G, Shurtleff SA, Pounds S, Cheng C, Ma J, Ribeiro RC, Rubnitz JE, Girtman K, Williams WK, Raimondi SC, Liang DC, Shih LY, Pui CH, Downing JR: Gene expression profiling of pediatric acute myelogenous leukemia. Blood 2004, 104(12):3679–3687. [http://dx.doi.org/10.1182/blood-2004–03–1154] 10.1182/blood-2004-03-1154

    Article  CAS  PubMed  Google Scholar 

  29. Yeoh E, ME R, SA S, WK W, D P, R M, FG B, SC R, MV R, A P, C C, D C, D W, X Z, J L, H L, CH P, WE E, C N, L W, JR D: Classification, subtype discovery, and prediction of outcome in pediatric acute lymphoblastic leukemia by gene expression profiling. Cancer Cell 2002, 1(2):133–143. 10.1016/S1535-6108(02)00032-6

    Article  CAS  PubMed  Google Scholar 

  30. Krishna D, LeDoux J: Murine leukemia virus particles activate Rac1 in HeLa cells. Biochem Biophys Res Commun 2006, 345(3):1184–93. 10.1016/j.bbrc.2006.05.027

    Article  CAS  PubMed  Google Scholar 

  31. Wang J, Rao Q, Wang M, Wei H, Xing H, Liu H, Wang Y, Tang K, Peng L, Tian Z, Wang J: Overexpression of Rac1 in leukemia patients and its role in leukemia cell migration and growth. Biochem Biophys Res Commun 2009, 386(4):769–74. 10.1016/j.bbrc.2009.06.125

    Article  CAS  PubMed  Google Scholar 

  32. Booden MA, Siderovski DP, Channing JD: Leukemia-associated Rho guanine nucleotide exchange factor promotes G alpha q-coupled activation of RhoA. Molecular and cellular biology 2002, 22(12):4053–61. 10.1128/MCB.22.12.4053-4061.2002

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  33. Kristelly R, Gao G, Tesmer JJG: Structural Determinants of RhoA Binding and Nucleotide Exchange in Leukemia-associated Rho Guanine-Nucleotide Exchange Factor. The Journal of Biological Chemistry 2004, 279: 47352–47362. 10.1074/jbc.M406056200

    Article  CAS  PubMed  Google Scholar 

  34. Katzav S: Flesh and blood: the story of Vav1, a gene that signals in hematopoietic cells but can be transforming in human malignancies. Cancer Lett 2007, 255(2):241–54. 10.1016/j.canlet.2007.04.015

    Article  CAS  PubMed  Google Scholar 

  35. Juliana L, Andrew Y, Jr FSA, Bing Y, de los Santos K, Goff SP: Interaction of Moloney murine leukemia virus matrix protein with IQGAP. The EMBO Journal 2006, 25: 2155- 2166. 10.1038/sj.emboj.7601097

    Article  Google Scholar 

  36. Balagopal P, Olney R, Darmaun D, Mougey E, Dokler M, Sieck G, Hammond D: Oxandrolone enhances skeletal muscle myosin synthesis and alters global gene expression profile in Duchenne muscular dystrophy. Am J Physiol Endocrinol Metab 2006, 290(3):E530–9.

    Article  CAS  PubMed  Google Scholar 

  37. Baker P, Kearney J, Gong B, Merriam A, Kuhn D, Porter J, Rafael-Fortney J: Analysis of gene expression differences between utrophin/dystrophin-deficient vs mdx skeletal muscles reveals a specific upregulation of slow muscle genes in limb muscles. Neurogenetics 2006, 7(2):81–91. 10.1007/s10048-006-0031-7

    Article  CAS  PubMed  Google Scholar 

  38. Garvey S, Rajan C, Lerner A, Frankel W, Cox G: The muscular dystrophy with myositis (mdm) mouse mutation disrupts a skeletal muscle-specific domain of titin. Genomics 2002, 79(2):146–9. 10.1006/geno.2002.6685

    Article  CAS  PubMed  Google Scholar 

  39. Hackman P, Vihola A, Haravuori H, Marchand S, Sarparanta J, Seze JD, Labeit S, Witt C, Peltonen L, Richard I, Udd B: Tibial muscular dystrophy is a titinopathy caused by mutations in TTN, the gene encoding the giant skeletal-muscle protein titin. American Journal of Human Genetics 2002, Sep 71(3):492–500.

    Article  PubMed  Google Scholar 

  40. Itoh-Satoh M, Hayashi T, Nishi H, Koga Y, Arimura T, Koyanagi T, Takahashi M, Hohda S, Ueda K, Nouchi T, Hiroe M, Marumo F, Imaizumi T, Yasunami M, Kimura A: Titin mutations as the molecular basis for dilated cardiomyopathy. Biochem Biophys Res Commun 2002, 291(2):385–93. 10.1006/bbrc.2002.6448

    Article  CAS  PubMed  Google Scholar 

  41. Gerull B, Gramlich M, Atherton J, McNabb M, K KT, Sasse-Klaassen S, Seidman J, Seidman C, Granzier H, Labeit S, Frenneaux M, Thierfelder L: Mutations of TTN, encoding the giant muscle filament titin, cause familial dilated cardiomyopathy. Nat Genet 2002, 30(2):201–4. 10.1038/ng815

    Article  CAS  PubMed  Google Scholar 

  42. Liu M, Liberzon A, Kong SW, Lai WR, Park PJ, Kohane IS, Kasif S: Network-Based Analysis of Affected Biological Processes in Type 2 Diabetes Models. PLoS Genet 2007, 3(6):e96+.

    Article  PubMed Central  PubMed  Google Scholar 

Download references

Acknowledgements

This research is supported in part by an A*STAR AIP scholarship (Soh) and an A*STAR grant SERC 072 101 0016 (Wong).

This article has been published as part of BMC Bioinformatics Volume 12 Supplement 13, 2011: Tenth International Conference on Bioinformatics – First ISCB Asia Joint Conference 2011 (InCoB/ISCB-Asia 2011): Bioinformatics. The full contents of the supplement are available online at http://www.biomedcentral.com/1471-2105/12?issue=S13.

Author information

Authors and Affiliations

  1. National University of Singapore, 13 Computing Drive, Singapore, 117417

    Donny Soh, Difeng Dong & Limsoon Wong

  2. Imperial College London, 180 Queens Gate, London, SW7 2BZ, UK

    Donny Soh & Yike Guo

  3. Institute for Infocomm Research, 1 Fusionopolis Way, 21-01 Connexis (South Tower), Singapore, 138632

    Donny Soh

Authors
  1. Donny Soh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Difeng Dong
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yike Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Limsoon Wong
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Donny Soh.

Additional information

Competing interests

The authors declare that they have no competing interests.

Authors' contributions

DS developed the software. DS and LW wrote the manuscript. All authors contributed to the design of analytical algorithms. All authors read and approved the final manuscript.

Rights and permissions

This article is published under license to BioMed Central Ltd. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and permissions

About this article

Cite this article

Soh, D., Dong, D., Guo, Y. et al. Finding consistent disease subnetworks across microarray datasets. BMC Bioinformatics 12 (Suppl 13), S15 (2011). https://doi.org/10.1186/1471-2105-12-S13-S15

Download citation

  • Published:

  • DOI: https://doi.org/10.1186/1471-2105-12-S13-S15

Keywords

BMC Bioinformatics

ISSN: 1471-2105

Contact us