Detection of locally over-represented GO terms in protein-protein interaction networks

3Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

High-throughput methods for identifying protein-protein interactions produce increasingly complex and intricate interaction networks. These networks are extremely rich in information, but extracting biologically meaningful hypotheses from them and representing them in a human-readable manner is challenging. We propose a method to identify Gene Ontology terms that are locally over-represented in a subnetwork of a given biological network. Specifically, we propose two methods to evaluate the degree of clustering of proteins associated to a particular GO term and describe four efficient methods to estimate the statistical significance of the observed clustering. We show, using Monte Carlo simulations, that our best approximation methods accurately estimate the true p-value, for random scale-free graphs as well as for actual yeast and human networks. When applied to these two biological networks, our approach recovers many known complexes and pathways, but also suggests potential functions for many subnetworks. © Springer-Verlag Berlin Heidelberg 2009.

Cite

CITATION STYLE

APA

Lavallée-Adam, M., Coulombe, B., & Blanchette, M. (2009). Detection of locally over-represented GO terms in protein-protein interaction networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5541 LNBI, pp. 302–320). https://doi.org/10.1007/978-3-642-02008-7_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free