Skip Navigation



Bioinformatics Advance Access published online on September 11, 2007
Bioinformatics, doi:10.1093/bioinformatics/btm440
This Article
Right arrow Advance Access manuscript (PDF) Freely available
Right arrowOA All Versions of this Article:
23/22/3024    most recent
btm440v1
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Google Scholar
Right arrow Articles by Grossmann, S.
Right arrow Articles by Vingron, M.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Grossmann, S.
Right arrow Articles by Vingron, M.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 2007 The Author(s)
This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/by-nc/2.0/uk/) which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

Improved Detection of Overrepresentation of Gene-Ontology Annotations with Parent-Child Analysis

Steffen Grossmann a, Sebastian Bauer b, Peter N. Robinson b and Martin Vingron a,*

aMax-Planck-Institute for Molecular Genetics, Ihnestr. 73, 14195 Berlin, Germany, bInstitute of Medical Genetics, Universitätsmedizin Charité Augustenburger Platz 1, 13353 Berlin, Germany

*To whom correspondence should be addressed. Martin Vingron, E-mail: vingron{at}molgen.mpg.de


  Abstract

Motivation: High-throughput experiments such as microarray hybridizations often yield long lists of genes found to share a certain characteristic such as differential expression. Exploring Gene Ontology (GO) annotations for such lists of genes has become a widespread practice to get first insights into the potential biological meaning of the experiment. The standard statistical approach to measuring overrepresentation of GO terms cannot cope with the dependencies resulting from the structure of GO because they analyze each term in isolation. Especially the fact that annotations are inherited from more specific descendant terms can result in certain types of false-positive results with potentially misleading biological interpretation, a phenomenon which we term the inheritance problem.

Results: We present here a novel approach to analysis of GO term overrepresentation that determines overrepresentation of terms in the context of annotations to the term's parents. This approach reduces the dependencies between the individual term's measurements, and thereby avoids producing false-positive results owing to the inheritance problem. ROC analysis using study sets with overrepresented GO terms showed a clear advantage for our approach over the standard algorithm with respect to the inheritance problem. Although there can be no gold standard for exploratory methods such as analysis of GO term overrepresentation, analysis of biological datasets suggests that our algorithm tends to identify the core GO terms that are most characteristic of the dataset being analyzed.

Availability: The Ontologizer can be found at the project homepage http://www.charite.de/ch/medgen/ontologizer

Contact: vingron@molgen.mpg.de

Associate Editor: Dr. Trey Ideker

Received on May 21, 2007; revised on August 3, 2007; accepted on August 20, 2007

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 BioinformaticsHome page
A. Senf and X.-w. Chen
Identification of genes involved in the same pathways using a Hidden Markov Model-based approach
Bioinformatics, November 15, 2009; 25(22): 2945 - 2954.
[Abstract] [Full Text] [PDF]

Home page
 Genome ResHome page
A. L. Hufton, S. Mathia, H. Braun, U. Georgi, H. Lehrach, M. Vingron, A. J. Poustka, and G. Panopoulou
Deeply conserved chordate noncoding sequences preserve genome synteny but do not drive gene duplicate retention
Genome Res., November 1, 2009; 19(11): 2036 - 2051.
[Abstract] [Full Text] [PDF]

Home page
 EndocrinologyHome page
S. M. Dupre, D. W. Burt, R. Talbot, A. Downing, D. Mouzaki, D. Waddington, B. Malpaux, J. R. E. Davis, G. A. Lincoln, and A. S. I. Loudon
Identification of Melatonin-Regulated Genes in the Ovine Pituitary Pars Tuberalis, a Target Site for Seasonal Hormone Control
Endocrinology, November 1, 2008; 149(11): 5527 - 5539.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
Y. Lu, R. Rosenfeld, I. Simon, G. J. Nau, and Z. Bar-Joseph
A probabilistic generative model for GO enrichment analysis
Nucleic Acids Res., October 1, 2008; 36(17): e109 - e109.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
S. Bauer, S. Grossmann, M. Vingron, and P. N. Robinson
Ontologizer 2.0--a multifunctional tool for GO term enrichment analysis and data exploration
Bioinformatics, July 15, 2008; 24(14): 1650 - 1651.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
A. V. Antonov, T. Schmidt, Y. Wang, and H. W. Mewes
ProfCom: a web tool for profiling the complex functionality of gene groups identified from high-throughput data
Nucleic Acids Res., July 1, 2008; 36(suppl_2): W347 - W351.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
L. Smeenk, S. J. van Heeringen, M. Koeppel, M. A. van Driel, S. J. J. Bartels, R. C. Akkers, S. Denissov, H. G. Stunnenberg, and M. Lohrum
Characterization of genome-wide p53-binding sites upon stress response
Nucleic Acids Res., June 1, 2008; 36(11): 3639 - 3654.
[Abstract] [Full Text] [PDF]


Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.