Skip to main content

Advertisement

Download PDF

Fast Gene Ontology based clustering for microarray experiments

BioData Mining volume 1, Article number: 11 (2008) Cite this article

Abstract

Background

Analysis of a microarray experiment often results in a list of hundreds of disease-associated genes. In order to suggest common biological processes and functions for these genes, Gene Ontology annotations with statistical testing are widely used. However, these analyses can produce a very large number of significantly altered biological processes. Thus, it is often challenging to interpret GO results and identify novel testable biological hypotheses.

Results

We present fast software for advanced gene annotation using semantic similarity for Gene Ontology terms combined with clustering and heat map visualisation. The methodology allows rapid identification of genes sharing the same Gene Ontology cluster.

Conclusion

Our R based semantic similarity open-source package has a speed advantage of over 2000-fold compared to existing implementations. From the resulting hierarchical clustering dendrogram genes sharing a GO term can be identified, and their differences in the gene expression patterns can be seen from the heat map. These methods facilitate advanced annotation of genes resulting from data analysis.

Peer Review reports

Background

A microarray experiment may result in hundreds of differentially expressed genes that are subject to interpretation and further analysis. As analysing these lists gene-by-gene is tedious and error prone, the genes in the lists are routinely annotated using Gene Ontology (GO) with an aim to identify statistically significant biological processes or pathways [1]. However, statistical analysis of GO annotations can produce a very large number of significantly enriched or down-regulated biological processes. Thus, it is often challenging to interpret GO results and identify novel testable biological hypotheses.

The GO project provides a species-independent controlled vocabulary for describing gene products (an RNA or protein product encoded by a gene) in terms of their biological processes, cellular components and molecular functions [1]. The GO annotations are carried out by curators of several bioinformatics databases, so the GO database is constantly updated. The ontology defines terms that are linked together to form a directed acyclic graph. Gene products are annotated with a number of ontology terms. Annotation with a given term also implies annotation with all ancestors of the term.

In this study we present methodology and software to cluster genes based on their biological functionality using GO annotations. Integral part of the methodology is the ability to rapidly compute pair-wise distances between the gene annotation similarities.

Two approaches to gene similarity computation are graph structure -based (GS) and information content -based (IC) measures. GS-based methods use the hierarchical structure of GO in computing gene similarity. IC-based methods additionally consider the a priori probabilities, or information contents, of GO terms in a reference gene set. IC-based measures have been found to perform better than pure graph-based measures [2, 3].

Czekanowski-Dice similarity [4] is a GS-based method. Distance of genes G 1 and G 2 is defined as

d ( G 1 , G 2 ) = # ( G O ( G 1 ) Δ G O ( G 2 ) ) # ( G O ( G 1 ) ∪ G O ( G 2 ) ) + # ( G O ( G 1 ) ∩ G O ( G 2 ) ) , MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xI8qiVKYPFjYdHaVhbbf9v8qqaqFr0xc9vqFj0dXdbba91qpepeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGaemizaqMaeiikaGIaem4raC0aaSbaaSqaaiabigdaXaqabaGccqGGSaalcqWGhbWrdaWgaaWcbaGaeGOmaidabeaakiabcMcaPiabg2da9KqbaoaalaaabaGaei4iamIaeiikaGIaem4raCKaem4ta8KaeiikaGIaem4raC0aaSbaaeaacqaIXaqmaeqaaiabcMcaPiabfs5aejabdEeahjabd+eapjabcIcaOiabdEeahnaaBaaabaGaeGOmaidabeaacqGGPaqkcqGGPaqkaeaacqGGJaWicqGGOaakcqWGhbWrcqWGpbWtcqGGOaakcqWGhbWrdaWgaaqaaiabigdaXaqabaGaeiykaKIaeyOkIGSaem4raCKaem4ta8KaeiikaGIaem4raC0aaSbaaeaacqaIYaGmaeqaaiabcMcaPiabcMcaPiabgUcaRiabcocaJiabcIcaOiabdEeahjabd+eapjabcIcaOiabdEeahnaaBaaabaGaeGymaedabeaacqGGPaqkcqGHPiYXcqWGhbWrcqWGpbWtcqGGOaakcqWGhbWrdaWgaaqaaiabikdaYaqabaGaeiykaKIaeiykaKcaaiabcYcaSaaa@68A2@

where Δ is the symmetric set difference, # is the number of elements in a set and GO(G i ) is the set of GO annotations for gene G i . Similarity can be defined as 1 - d(G 1, G 2).

In Kappa statistics [5], each gene is represented as a binary vector (g 1,...,g N ), where g i is 1 if the gene is annotated with the GO term g i and 0 otherwise. N is the total number of GO terms under consideration.

Similarity of genes G 1 and G 2 is defined as

K G 1 , G 2 = O G 1 , G 2 − A G 1 , G 2 1 − A G 1 , G 2 , MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xI8qiVKYPFjYdHaVhbbf9v8qqaqFr0xc9vqFj0dXdbba91qpepeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGaem4saS0aaSbaaSqaaiabdEeahnaaBaaameaacqaIXaqmaeqaaSGaeiilaWIaem4raC0aaSbaaWqaaiabikdaYaqabaaaleqaaOGaeyypa0tcfa4aaSaaaeaacqWGpbWtdaWgaaqaaiabdEeahnaaBaaabaGaeGymaedabeaacqGGSaalcqWGhbWrdaWgaaqaaiabikdaYaqabaaabeaacqGHsislcqWGbbqqdaWgaaqaaiabdEeahnaaBaaabaGaeGymaedabeaacqGGSaalcqWGhbWrdaWgaaqaaiabikdaYaqabaaabeaaaeaacqaIXaqmcqGHsislcqWGbbqqdaWgaaqaaiabdEeahnaaBaaabaGaeGymaedabeaacqGGSaalcqWGhbWrdaWgaaqaaiabikdaYaqabaaabeaaaaGaeiilaWcaaa@4B5C@

where O G 1 , G 2 MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGaem4ta80aaSbaaSqaaiabdEeahnaaBaaameaacqaIXaqmaeqaaSGaeiilaWIaem4raC0aaSbaaWqaaiabikdaYaqabaaaleqaaaaa@3288@ represents observed co-occurrence of GO terms and A G 1 , G 2 MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGaemyqae0aaSbaaSqaaiabdEeahnaaBaaameaacqaIXaqmaeqaaSGaeiilaWIaem4raC0aaSbaaWqaaiabikdaYaqabaaaleqaaaaa@326C@ represents random co-occurrence. O G 1 , G 2 MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGaem4ta80aaSbaaSqaaiabdEeahnaaBaaameaacqaIXaqmaeqaaSGaeiilaWIaem4raC0aaSbaaWqaaiabikdaYaqabaaaleqaaaaa@3288@ is the relative frequency of agreeing locations in the two binary vectors, i.e., locations that are either both 0 or both 1. A G 1 , G 2 MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGaemyqae0aaSbaaSqaaiabdEeahnaaBaaameaacqaIXaqmaeqaaSGaeiilaWIaem4raC0aaSbaaWqaaiabikdaYaqabaaaleqaaaaa@326C@ is the expected relative frequency of such locations if the binary vectors were random, taking into account the observed probabilities of 0's and 1's.

The following discussion considers IC-based similarity measures. The information content of a GO term is computed by the frequency of the term occurring in annotations; a rarely used term contains a greater amount of information. Probability for observing a term t is defined as p ( t ) = Freq ( t ) MaxFreq MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGaemiCaaNaeiikaGIaemiDaqNaeiykaKIaeyypa0tcfa4aaSaaaeaacqqGgbGrcqqGYbGCcqqGLbqzcqqGXbqCcqGGOaakcqqG0baDcqGGPaqkaeaacqqGnbqtcqqGHbqycqqG4baEcqqGgbGrcqqGYbGCcqqGLbqzcqqGXbqCaaaaaa@4377@ , where MaxFreq is the maximum frequency of all terms [6]. The information content for a term t is given as IC(t) = -log2 p(t). Probabilities can be estimated from a corpus of annotations, such as the Gene Ontology database.

Several related similarity metrics are based on the most informative common ancestor (MICA) of two GO terms and were introduced in the context of GO by Lord et al. [7]. To compute the semantic similarity between terms t 1 and t 2, we first find the most informative common ancestor A of t 1 and t 2, i.e., A is a term that is an ancestor of both t 1 and t 2 and has the maximum IC among common ancestors CommonAnc(t 1, t 2) of the terms. Now, the Resnik similarity [8] is defined as

Several other measures are defined that also take the information contents of t 1 and t 2 into account. The Lin measure [9] is defined as

Sim L i n ( t 1 , t 2 ) = 2 I C ( A ) I C ( t 1 ) + I C ( t 2 ) . MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xI8qiVKYPFjYdHaVhbbf9v8qqaqFr0xc9vqFj0dXdbba91qpepeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGaee4uamLaeeyAaKMaeeyBa02aaSbaaSqaaiabdYeamjabdMgaPjabd6gaUbqabaGccqGGOaakcqWG0baDdaWgaaWcbaGaeGymaedabeaakiabcYcaSiabdsha0naaBaaaleaacqaIYaGmaeqaaOGaeiykaKIaeyypa0tcfa4aaSaaaeaacqaIYaGmcqWGjbqscqWGdbWqcqGGOaakcqWGbbqqcqGGPaqkaeaacqWGjbqscqWGdbWqcqGGOaakcqWG0baDdaWgaaqaaiabigdaXaqabaGaeiykaKIaey4kaSIaemysaKKaem4qamKaeiikaGIaemiDaq3aaSbaaeaacqaIYaGmaeqaaiabcMcaPaaakiabc6caUaaa@51EE@
(1)

Jiang and Conrath [10] define a semantic distance metric as

The corresponding similarity measure for d JC (t 1, t 2) [6] is given by

Sim J C ( t 1 , t 2 ) = 1 d J C ( t 1 , t 2 ) + 1 . MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xI8qiVKYPFjYdHaVhbbf9v8qqaqFr0xc9vqFj0dXdbba91qpepeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGaee4uamLaeeyAaKMaeeyBa02aaSbaaSqaaiabdQeakjabdoeadbqabaGccqGGOaakcqWG0baDdaWgaaWcbaGaeGymaedabeaakiabcYcaSiabdsha0naaBaaaleaacqaIYaGmaeqaaOGaeiykaKIaeyypa0tcfa4aaSaaaeaacqaIXaqmaeaacqWGKbazdaWgaaqaaiabdQeakjabdoeadbqabaGaeiikaGIaemiDaq3aaSbaaeaacqaIXaqmaeqaaiabcYcaSiabdsha0naaBaaabaGaeGOmaidabeaacqGGPaqkcqGHRaWkcqaIXaqmaaGccqGGUaGlaaa@4AB8@

Finally, the Relevance measure [11] that combines Lin's and Resnik's measures is defined as

Sim R e l ( t 1 , t 2 ) = max t ∈ C o m m o n A n c ( t 1 , t 2 ) 2 log p ( t ) ( 1 − p ( t ) ) log p ( t 1 ) + log p ( t 2 ) = 2 I C ( A ) ( 1 − p ( A ) ) I C ( t 1 ) + I C ( t 2 ) . MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xI8qiVKYPFjYdHaVhbbf9v8qqaqFr0xc9vqFj0dXdbba91qpepeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGaee4uamLaeeyAaKMaeeyBa02aaSbaaSqaaiabdkfasjabdwgaLjabdYgaSbqabaGccqGGOaakcqWG0baDdaWgaaWcbaGaeGymaedabeaakiabcYcaSiabdsha0naaBaaaleaacqaIYaGmaeqaaOGaeiykaKIaeyypa0ZaaCbeaeaacyGGTbqBcqGGHbqycqGG4baEaSqaaiabdsha0jabgIGiolabdoeadjabd+gaVjabd2gaTjabd2gaTjabd+gaVjabd6gaUjabdgeabjabd6gaUjabdogaJjabcIcaOiabdsha0naaBaaameaacqaIXaqmaeqaaSGaeiilaWIaemiDaq3aaSbaaWqaaiabikdaYaqabaWccqGGPaqkaeqaaKqbaoaalaaabaGaeGOmaiJagiiBaWMaei4Ba8Maei4zaCMaemiCaaNaeiikaGIaemiDaqNaeiykaKIaeiikaGIaeGymaeJaeyOeI0IaemiCaaNaeiikaGIaemiDaqNaeiykaKIaeiykaKcabaGagiiBaWMaei4Ba8Maei4zaCMaemiCaaNaeiikaGIaemiDaq3aaSbaaeaacqaIXaqmaeqaaiabcMcaPiabgUcaRiGbcYgaSjabc+gaVjabcEgaNjabdchaWjabcIcaOiabdsha0naaBaaabaGaeGOmaidabeaacqGGPaqkaaGccqGH9aqpjuaGdaWcaaqaaiabikdaYiabdMeajjabdoeadjabcIcaOiabdgeabjabcMcaPiabcIcaOiabigdaXiabgkHiTiabdchaWjabcIcaOiabdgeabjabcMcaPiabcMcaPaqaaiabdMeajjabdoeadjabcIcaOiabdsha0naaBaaabaGaeGymaedabeaacqGGPaqkcqGHRaWkcqWGjbqscqWGdbWqcqGGOaakcqWG0baDdaWgaaqaaiabikdaYaqabaGaeiykaKcaaOGaeiOla4caaa@9C43@

The MICA-based measures can be modified to take into account so called disjunctive ancestor terms [6]. Two ancestors a 1 and a 2 of a term t are disjunctive if there are independent paths from a 1 to t and from a 2 to t. Such ancestors represent distinct interpretations of the term t. In the GraSM enhancement, all common disjunctive ancestors of terms t 1 and t 2 are considered when computing Sim(t 1, t 2) [6]. GraSM modifies the computation of IC(A) and can be applied to the Resnik, Lin and Jiang-Conrath measures.

After computing the pair-wise term similarities, the next step in MICA-based measures is to calculate the similarity between genes G 1 and G 2. This can be done in several ways and our package supports three most commonly used methods. In the two simplest methods, the maximum or the mean of pair-wise GO term similarities between annotation sets of G 1 and G 2 is used as the similarity value [12]. That is, when G 1 is annotated with terms t 1,...,t n and G 2 with terms t ′ 1 , ... , t ′ m MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaGafmiDaqNbauaadaWgaaWcbaGaeGymaedabeaakiabcYcaSiabc6caUiabc6caUiabc6caUiabcYcaSiqbdsha0zaafaWaaSbaaSqaaiabd2gaTbqabaaaaa@35F0@ , pair-wise term similarities form an n × m matrix S. Now, Sim gene (G 1, G 2) is the maximum or the mean of the matrix. In the third method, similarity is defined as Sim gene (G 1, G 2) = max{rowScore, columnScore} [11], where

r o w S c o r e = 1 n ∑ i = 1 n max 1 ≤ j ≤ m S i j and c o l u m n S c o r e = 1 m ∑ j = 1 m max 1 ≤ i ≤ n S i j . MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xI8qiVKYPFjYdHaVhbbf9v8qqaqFr0xc9vqFj0dXdbba91qpepeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaqbaeqabeWaaaqaaiabdkhaYjabd+gaVjabdEha3jabdofatjabdogaJjabd+gaVjabdkhaYjabdwgaLjabg2da9KqbaoaalaaabaGaeGymaedabaGaemOBa4gaaOWaaabCaeaadaWfqaqaaiGbc2gaTjabcggaHjabcIha4bWcbaGaeGymaeJaeyizImQaemOAaOMaeyizImQaemyBa0gabeaakiabhofatnaaBaaaleaacqWGPbqAcqWGQbGAaeqaaaqaaiabdMgaPjabg2da9iabigdaXaqaaiabd6gaUbqdcqGHris5aaGcbaGaeeyyaeMaeeOBa4MaeeizaqgabaGaem4yamMaem4Ba8MaemiBaWMaemyDauNaemyBa0MaemOBa4Maem4uamLaem4yamMaem4Ba8MaemOCaiNaemyzauMaeyypa0tcfa4aaSaaaeaacqaIXaqmaeaacqWGTbqBaaGcdaaeWbqaamaaxababaGagiyBa0MaeiyyaeMaeiiEaGhaleaacqaIXaqmcqGHKjYOcqWGPbqAcqGHKjYOcqWGUbGBaeqaaOGaeC4uam1aaSbaaSqaaiabdMgaPjabdQgaQbqabaaabaGaemOAaOMaeyypa0JaeGymaedabaGaemyBa0ganiabggHiLdGccqGGUaGlaaaaaa@801E@

In addition to MICA- and GraSM-based measures, we have implemented the cosine similarity and SimGIC measures. In cosine similarity [13], each gene G is represented as a vector (w 1, w 2,...,w N ), where each w i is IC(t i ) if G is annotated with the term t i , or 0 otherwise. N is the total number of GO terms under consideration. Similarity of genes G 1 and G 2 is defined as G 1 ⋅ G 2 | G 1 | | G 2 | MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaqcfa4aaSaaaeaacqWGhbWrdaWgaaqaaiabigdaXaqabaGaeyyXICTaem4raC0aaSbaaeaacqaIYaGmaeqaaaqaaiabcYha8jabdEeahnaaBaaabaGaeGymaedabeaacqGG8baFcqGG8baFcqWGhbWrdaWgaaqaaiabikdaYaqabaGaeiiFaWhaaaaa@3D61@ , where · is the dot product and |v| is the vector norm. This is the cosine of the angle between vectors G 1 and G 2. In the SimGIC (Graph Information Content) measure [3], similarity of genes G 1 and G 2 is defined as

Σ t ∈ G O ( G 1 ) ∩ G O ( G 2 ) I C ( t ) Σ t ∈ G O ( G 1 ) ∪ G O ( G 2 ) I C ( t ) , MathType@MTEF@5@5@+=feaagaart1ev2aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xI8qiVKYPFjYdHaVhbbf9v8qqaqFr0xc9vqFj0dXdbba91qpepeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGaciGaaiaabeqaaeqabiWaaaGcbaqcfa4aaSaaaeaacqqHJoWudaWgaaqaaiabdsha0jabgIGiolabdEeahjabd+eapjabcIcaOiabdEeahnaaBaaabaGaeGymaedabeaacqGGPaqkcqGHPiYXcqWGhbWrcqWGpbWtcqGGOaakcqWGhbWrdaWgaaqaaiabikdaYaqabaGaeiykaKcabeaacqWGjbqscqWGdbWqcqGGOaakcqWG0baDcqGGPaqkaeaacqqHJoWudaWgaaqaaiabdsha0jabgIGiolabdEeahjabd+eapjabcIcaOiabdEeahnaaBaaabaGaeGymaedabeaacqGGPaqkcqGHQicYcqWGhbWrcqWGpbWtcqGGOaakcqWGhbWrdaWgaaqaaiabikdaYaqabaGaeiykaKcabeaacqWGjbqscqWGdbWqcqGGOaakcqWG0baDcqGGPaqkaaGaeiilaWcaaa@5D11@

where GO(G i ) gives the GO annotations of gene G i . SimGIC is a hybrid of GS- and IC-based methods.

Given similarities between the genes we use hierarchical clustering with heat map presentation to visualise both semantic similarities and expression levels of the genes. First, similarity measures are converted to distances using d(x, y) = 1 - Sim(x, y) when the similarity range is [0, 1] (Czekanowski-Dice, Kappa, Lin, Jiang-Conrath, Relevance, Cosine, SimGIC) or using d(x, y) = 1/(Sim(x, y) + 1) when the range is [0, ∞) (Resnik). Second, a hierarchical clustering algorithm is run using the converted distances. The results are visualised as a dendrogram and heat map. The dendrogram is generated using the GO semantic distances and allows identification of clusters containing genes contributing to the same biological process. For each cluster we compute statistical significance with a permutation test. The heat map illustrates gene expression data obtained from microarray analysis. Thus, the visualisation framework integrates both functional gene expression levels to biological processes, which facilitates interpretation of the gene expression analysis results.

Implementation

The semantic similarity package, csbl.go, is available for R [14]. The package computes similarities for arbitrary number of genes and supports the following measures: Czekanowski-Dice, Kappa, Resnik (with GraSM as an option), Jiang-Conrath (GraSM), Lin (GraSM), Relevance, Cosine and SimGIC. The MICA-based measures (Resnik, Lin, Jiang-Conrath, Relevance and GraSM enhancements) are implemented as a combination of R and C++ code; the four other measures are implemented in R. In addition to the regular R package, csbl.go is available as a component for Anduril [15], a framework for high-throughput data analysis we recently developed. The package is extensively tested and includes a user guide.

Similarity computation needs GO term probabilities for the reference gene set. We provide precomputed probability tables for Homo sapiens, Saccharomyces cerevisiae, Caenorhabditis elegans, Drosophila melanogaster, Mus musculus and Rattus norvegicus. The tables are computed based on all gene and protein annotations for the given organism found in the geneontology.org database. As GO is constantly updated and revised, we update the tables every six months. The package also has an option to use custom tables. The taxonomy ID of the organism is stored along with probability tables as metadata, which enables selection of a table by organism ID. The package also includes an option to compute GO term enrichment using Fisher's Exact Test [16].

Results and discussion

We evaluated the package by using a performance benchmark and by applying the methods to microarray data from a testicular germ cell tumor study [17].

Performance benchmark

We compared the performance of our package to two earlier introduced semantic similarity packages, SemSim 1.6.0 [18] and GOSim 1.1.5.1 [12]. The benchmark computes semantic similarities for GO term set sizes 50, 100 and 200. For csbl.go and SemSim, the measures Resnik, Jiang-Conrath, Lin and Relevance are used in the benchmark. GOSim does not support the Relevance measure so only the three other measures are used for it. The GraSM enhancement was not used in the benchmark as SemSim does not support GraSM.

The benchmark computes a symmetric n × n similarity matrix for the GO term sets. The three packages handle matrix computation in different ways. GOSim and csbl.go take a single term list and compute the symmetric matrix by computing half of of the pair-wise similarities (n 2/2) and mirroring the matrix by the diagonal. SemSim takes two potentially different term lists and computes all n 2 pair-wise similarities. To compare the packages, we halved the execution times of SemSim in order to consider a situation where all packages perform n 2/2 operations. The benchmark computes GO term similarities instead of gene similarities because the former is the most time-consuming part of similarity computation.

Benchmark results are in shown in Table 1. With the csbl.go package we obtained 2400- to 5000-fold (GOSim) and 2100- to 3000-fold (SemSim) speed gains. The speed gain achieved by csbl.go becomes more obvious with larger number of GO terms. For example, with 1000 terms SemSim and GOSim take more than 30 minutes while csbl.go takes less than one second.

Table 1 Benchmark results.
Full size table

Case study

As a case study, we applied similarity measures to identify common GO classes for differentially expressed genes involved in testicular germ cell tumors (TGCTs). The TGCT microarray study here consists of five undifferentiated embryonal carcinoma samples and 12 differentiated testicular cell samples, which include both tumors and healthy samples [17].

We re-analysed the data set with the goal of finding differentially expressed genes (DEGs) between four undifferentiated samples (EC_0502, EC_0564, EC_1017 and EC_1740) and 10 differentiated samples (Cc_0915, N_9013, N_9014, N_0140, Ter_0691, Ter_0696, YST_0216, YST_0307, YST_0738, YST_2110). Three samples (EC_1838, Ter_1282 and Ter_2201) were excluded due to data quality problems. Data from the two-channel Agilent Human 1A were background corrected and processed with LOWESS [19]. DEGs were selected using t-test followed by false discovery rate correction [20]. We obtained 65 genes that have q-value below 0.1 and have also fold change of at least 1.5. We found GO annotations for 58 of the 65 genes using Ensembl version 50 [21]. Among the 58 genes, the median number of GO annotations per gene is eight.

We computed the similarities between the 58 DEGs using the Lin measure and converted the similarity matrix into distance using d(x, y) = 1 - Sim(x, y). Then we used agglomerative hierarchical clustering in R to generate gene clusters based on the GO distance matrix. The heat map that combines GO clusters and expression data is shown in Figure 1. GO-based clustering for the genes is visualised with a dendrogram on the left. To visualise the relationships between samples, a second dendrogram based on expression profiles is shown on the top. Using a dendrogram cutoff value of 0.35 we obtained nine clusters that are numbered G 1,...,G 9. The gene names for these nine clusters are given in Table 2 in the same order as Figure 1. To gain further insight into the clusters, we extracted the most informative GO terms for each cluster. These are terms that occur in every gene of the cluster (taking parent-child relationships into account) and have the largest information contents. The most informative terms for each cluster and their IC values are listed in Table 3. To assess the significance of the IC values, we computed p-values using a permutation test [16]. To obtain the p-value for a cluster with the size k, we generated 10000 random clusters with size k and computed IC of the most informative term in each cluster. The p-value is then the fraction of clusters having IC at least as great as the cluster under study.

Figure 1
figure1

GO heat map and clustering. GO based clustering dendrogram of the selected genes (vertical axis) is visualised along with the expression patterns that are used to cluster the samples (horizontal axis). There are nine GO-based clusters named G 1,...,G 9 that contain more than one gene. The GO clusters are separated by a horizontal bar in the heat map. Genes without annotations are omitted from the heat map. Overexpressed genes are shown with white or yellow color and underexpressed genes with red color.

Full size image
Table 2 Genes corresponding to the most statistically significant clusters found in the case study.
Full size table
Table 3 Most informative GO terms for the clusters obtained from microarray data.
Full size table

The cluster G 5 consists of two genes: cystathionase (CTH) and glyoxalase I (GLO1). These two genes correlate strongly in their GO terms as their extremely high IC-value of 12.0 indicates. Also their gene expression patterns are almost identical across the samples as shown in the heat map in Figure 1. GLO1 is a glutathione-binding protein that contributes to several pathways that are associated with various diseases, such as cancers [22]. As glutathione plays a key role in the process where tumor cells acquire resistance to anti-cancer drugs, GLO1 inhibitors are considered as potential anti-cancer agents [22, 23]. CTH is a critical factor in glutathione synthesis and has recently been associated with increased risk of bladder cancer [24]. While detailed discussion of the exact roles of CTH and GLO1 in embryonal carcinomas is out of scope of this study, our results suggest that GLO1 and CTH may function in concert, and contribute to tumor progression and drug resistance in embryonic cancers.

Interestingly, CTH and GLO1 contribute to the same biological process but do not have common pathways in the KEGG pathway database [25] as shown in Table 4 that contains all KEGG pathways associated to genes in Table 2. Thus, CTH and GLO1 would not have been grouped together with standard pathway analyses despite the fact that, based on literature, their biological function is markedly similar.

Table 4 KEGG pathways for differentially expressed genes.
Full size table

Conclusion

We have developed tools to cluster genes from microarray experiments using semantic similarity measures. Using benchmark tests we demonstrated clear speed gain as compared to existing implementations. Our efficient implementation of similarity measures enables analysis of gene sets with hundreds of genes that are typically seen in microarray experiments. We then combined expression data and GO annotations using hierarchical clustering and a heat map visualisation that together enable rapid identification of genes sharing similar biological functions. In our case study we further analysed genes that are differentially expressed in testicular germ cell tumors between undifferentiated embryonal carcinomas and differentiated testicular cells. Our results suggest that GO-based annotation analysis approaches may be able to take advantage of the accumulated knowledge available in literature over approaches using pathway databases, which are typically updated in a much slower pace than the GO database. In summary, the csbl.go package allows rapid visualisation of gene GO and expression profiles, and thereby facilitates hypothetisising gene functions in cells.

Availability and requirements

References

  1. 1.

    Ashburner M, Ball C, Blake J, Botstein D, Butler H, Cherry J, Davis A, Dolinski K, Dwight S, Eppig J, Harris M, Hill D, Issel-Tarver L, Kasarskis A, Lewis S, Matese J, Richardson J, Ringwald M, Rubin G, Sherlock G: Gene ontology: tool for the unification of biology. The Gene Ontology Consortium. Nat Genet. 2000, 25: 25-9. 10.1038/75556.

  2. 2.

    Guo X, Liu R, Shriver C, Hu H, Liebman M: Assessing semantic similarity measures for the characterization of human regulatory pathways. Bioinformatics. 2006, 22 (8): 967-10.1093/bioinformatics/btl042.

  3. 3.

    Pesquita C, Faria D, Bastos H, Ferreira A, Falcão A, Couto F: Metrics for GO based protein semantic similarity: a systematic evaluation. BMC Bioinformatics. 2008, 9 (5): S4-10.1186/1471-2105-9-S5-S4.

  4. 4.

    Brun C, Chevenet F, Martin D, Wojcik J, Guenoche A, Jacq B: Functional classification of proteins for the prediction of cellular function from a protein-protein interaction network. GENOME BIOLOGY. 2004, 5: 6-6. 10.1186/gb-2003-5-1-r6.

  5. 5.

    Huang D, Sherman B, Tan Q, Collins J, Alvord W, Roayaei J, Stephens R, Baseler M, Lane H, Lempicki R: The DAVID Gene Functional Classification Tool: a novel biological module-centric algorithm to functionally analyze large gene lists. Genome Biol. 2007, 8 (9): R183-10.1186/gb-2007-8-9-r183.

  6. 6.

    Couto FM, Silva MJ, Coutinho PM: Measuring semantic similarity between Gene Ontology terms. Data Knowl Eng. 2007, 61: 137-152. 10.1016/j.datak.2006.05.003.

  7. 7.

    Lord P, Stevens R, Brass A, Goble C: Investigating semantic similarity measures across the Gene Ontology: the relationship between sequence and annotation. Bioinformatics. 2003, 19 (10): 1275-1283. 10.1093/bioinformatics/btg153.

  8. 8.

    Resnik P: Using information content to evaluate semantic similarity in a taxonomy. Proceedings of the 14th International Joint Conference on Artificial Intelligence. 1995, 1: 448-453.

  9. 9.

    Lin D: An information-theoretic defiition of similarity. Proceedings of the 15th International Conference on Machine Learning. 1998, 296-304.

  10. 10.

    Jiang J, Conrath D: Semantic similarity based on corpus statistics and lexical taxonomy. Proceedings of International Conference on Research in Computational Linguistics. 1997, 19-33.

  11. 11.

    Schlicker A, Domingues F, Rahnenführer J, Lengauer T: A new measure for functional similarity of gene products based on Gene Ontology. BMC Bioinformatics. 2006, 7: 302-10.1186/1471-2105-7-302.

  12. 12.

    Frohlich H, Speer N, Poustka A, Beißbarth T: GOSim-An R-package for computation of information theoretic GO similarities between terms and gene products. BMC Bioinformatics. 2007, 8: 166-10.1186/1471-2105-8-166.

  13. 13.

    Bodenreider O, Aubry M, Burgun A: Non-lexical approaches to identifying associative relations in the Gene Ontology. Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing. 2005, 91-

  14. 14.

    R Development Core Team: R: A Language and Environment for Statistical Computing. 2007, R Foundation for Statistical Computing, Vienna, Austria, [http://www.R-project.org]

  15. 15.

    Anduril framework. [http://csbi.ltdk.helsinki.fi/anduril/]

  16. 16.

    Good P: Permutation tests: a practical guide to resampling methods for testing hypotheses. 2000, Springer series in statistics

  17. 17.

    Skotheim R, Lind G, Monni O, Nesland J, Abeler V, Fossa S, Duale N, Brunborg G, Kallioniemi O, Andrews P, Lothe R: Differentiation of human embryonal carcinomas in vitro and in vivo reveals expression profiles relevant to normal development. Cancer Research. 2005, 65 (13): 5588-5598. 10.1158/0008-5472.CAN-05-0153.

  18. 18.

    SemSim package. [http://bioconductor.org/packages/2.1/bioc/html/SemSim.html]

  19. 19.

    Draghici S: Data Analysis Tools for DNA Microarrays. 2003, Chapman & Hall/CRC

  20. 20.

    Pounds S, Cheng C: Robust estimation of the false discovery rate. Bioinformatics. 2006, 22 (16): 1979-10.1093/bioinformatics/btl328.

  21. 21.

    Hubbard T, Barker D, Birney E, Cameron G, Chen Y, Clark L, Cox T, Cuff J, Curwen V, Down T, Durbin R, Eyras E, Gilbert J, Hammond M, Huminiecki L, Kasprzyk A, Lehvaslaiho H, Lijnzaad P, Melsopp C, Mongin E, Pettett R, Pocock M, Potter S, Rust A, Schmidt E, Searle S, Slater G, Smith J, Spooner W, Stabenau A: The Ensembl genome database project. Nucleic Acids Research. 2002, 30: 38-10.1093/nar/30.1.38.

  22. 22.

    Laga M, Cottyn A, Van Herreweghe F, Berghe W, Haegeman G, Van Oostveldt P, Vandekerckhove J, Vancompernolle K: Methylglyoxal suppresses TNF-α-induced NF-κB activation by inhibiting NF-κB DNA-binding. Biochemical Pharmacology. 2007, 74 (4): 579-589. 10.1016/j.bcp.2007.05.026.

  23. 23.

    Balendiran G, Dabur R, Fraser D: The role of glutathione in cancer. Cell Biochemistry And Function. 2004, 22: 343-352. 10.1002/cbf.1149.

  24. 24.

    Moore L, Malats N, Rothman N, Real F, Kogevinas M, Karami S, Garcia-Closas R, Silverman D, Chanock S, Welch R, Tardffon A, Serra C, Carrato A, Dosemeci M, García-Closas M: Polymorphisms in one-carbon metabolism and trans-sulfuration pathway genes and susceptibility to bladder cancer. Int J Cancer. 2007, 120 (11): 2452-8. 10.1002/ijc.22565.

  25. 25.

    Kanehisa M, Goto S: KEGG: Kyoto Encyclopedia of Genes and Genomes. Nucleic Acids Research. 2000, 28: 27-10.1093/nar/28.1.27.

Download references

Acknowledgements

We thank Dr Rolf I Skotheim for providing the testicular germ cell tumor microarray data. Financial support from Helsinki University Funds, Sigrid Jusélius Foundation, Biocentrum Helsinki, Academy of Finland (project 125826) and the Graduate School in Computational Biology, Bioinformatics, and Biometry (ComBi) is gratefully acknowledged.

Author information

Affiliations

  1. Computational Systems Biology Laboratory, Institute of Biomedicine and Genome-Scale Biology Program, Biomedicum Helsinki, University of Helsinki, UNIVERSITY OF HELSINKI, PO Box 63, (Haartmaninkatu 8), 00014, Finland
    • Kristian Ovaska
    • , Marko Laakso
    •  & Sampsa Hautaniemi
Authors
  1. Kristian Ovaska
    View author publications
    You can also search for this author in
  2. Marko Laakso
    View author publications
    You can also search for this author in
  3. Sampsa Hautaniemi
    View author publications
    You can also search for this author in

Corresponding author

Correspondence to Sampsa Hautaniemi.

Additional information

Competing interests

The authors declare that they have no competing interests.

Authors' contributions

KO implemented the semantic similarity measures and GO based clustering functionality, and wrote the manuscript. ML implemented the heat map visualisation, provided a tool to retrieve Ensembl annotations and critically commented the manuscript. SH coordinated the study and was involved in writing the manuscript. All authors read and approved the final manuscript.

Authors’ original submitted files for images

Below are the links to the authors’ original submitted files for images.

Authors’ original file for figure 1

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Ovaska, K., Laakso, M. & Hautaniemi, S. Fast Gene Ontology based clustering for microarray experiments. BioData Mining 1, 11 (2008). https://doi.org/10.1186/1756-0381-1-11

Download citation

Keywords

  • Gene Ontology
  • Semantic Similarity
  • Testicular Germ Cell Tumor
  • Semantic Distance
  • Speed Gain

BioData Mining

ISSN: 1756-0381