Improved scoring of functional groups from gene expression data by decorrelating GO graph structure.

return to the website
by Adrian Alexa, Jörg Rahnenführer, Thomas Lengauer
Abstract:
MOTIVATION: The result of a typical microarray experiment is a long list of genes with corresponding expression measurements. This list is only the starting point for a meaningful biological interpretation. Modern methods identify relevant biological processes or functions from gene expression data by scoring the statistical significance of predefined functional gene groups, e.g. based on Gene Ontology (GO). We develop methods that increase the explanatory power of this approach by integrating knowledge about relationships between the GO terms into the calculation of the statistical significance. RESULTS: We present two novel algorithms that improve GO group scoring using the underlying GO graph topology. The algorithms are evaluated on real and simulated gene expression data. We show that both methods eliminate local dependencies between GO terms and point to relevant areas in the GO graph that remain undetected with state-of-the-art algorithms for scoring functional terms. A simulation study demonstrates that the new methods exhibit a higher level of detecting relevant biological terms than competing methods.
Reference:
Improved scoring of functional groups from gene expression data by decorrelating GO graph structure. (Adrian Alexa, Jörg Rahnenführer, Thomas Lengauer), In Bioinformatics (Oxford, England), volume 22, 2006.
Bibtex Entry:
@article{Alexa2006,
abstract = {MOTIVATION: The result of a typical microarray experiment is a long list of genes with corresponding expression measurements. This list is only the starting point for a meaningful biological interpretation. Modern methods identify relevant biological processes or functions from gene expression data by scoring the statistical significance of predefined functional gene groups, e.g. based on Gene Ontology (GO). We develop methods that increase the explanatory power of this approach by integrating knowledge about relationships between the GO terms into the calculation of the statistical significance. RESULTS: We present two novel algorithms that improve GO group scoring using the underlying GO graph topology. The algorithms are evaluated on real and simulated gene expression data. We show that both methods eliminate local dependencies between GO terms and point to relevant areas in the GO graph that remain undetected with state-of-the-art algorithms for scoring functional terms. A simulation study demonstrates that the new methods exhibit a higher level of detecting relevant biological terms than competing methods.},
author = {Alexa, Adrian and Rahnenf\"{u}hrer, J\"{o}rg and Lengauer, Thomas},
doi = {10.1093/bioinformatics/btl140},
issn = {1367-4803},
journal = {Bioinformatics (Oxford, England)},
keywords = {Algorithms,Cluster Analysis,Computational Biology,Computational Biology: methods,Databases, Genetic,Gene Expression Profiling,Gene Expression Regulation,Gene Expression Regulation, Neoplastic,Humans,Leukemia,Leukemia: metabolism,Models, Statistical,Oligonucleotide Array Sequence Analysis,Protein Folding,SML-LIB-BIBLIO,lang:ENG},
mendeley-tags = {SML-LIB-BIBLIO,lang:ENG},
month = jul,
number = {13},
pages = {1600--7},
pmid = {16606683},
title = {{Improved scoring of functional groups from gene expression data by decorrelating GO graph structure.}},
url = {http://www.ncbi.nlm.nih.gov/pubmed/16606683},
volume = {22},
year = {2006}
}
Powered by bibtexbrowser