Abstract

BackgroundMany methods have been developed to infer and reason about molecular interaction networks. These approaches often yield networks with hundreds or thousands of nodes and up to an order of magnitude more edges. It is often desirable to summarize the biological information in such networks. A very common approach is to use gene function enrichment analysis for this task. A major drawback of this method is that it ignores information about the edges in the network being analyzed, i.e., it treats the network simply as a set of genes. In this paper, we introduce a novel method for functional enrichment that explicitly takes network interactions into account.ResultsOur approach naturally generalizes Fisher’s exact test, a gene set-based technique. Given a function of interest, we compute the subgraph of the network induced by genes annotated to this function. We use the sequence of sizes of the connected components of this sub-network to estimate its connectivity. We estimate the statistical significance of the connectivity empirically by a permutation test. We present three applications of our method: i) determine which functions are enriched in a given network, ii) given a network and an interesting sub-network of genes within that network, determine which functions are enriched in the sub-network, and iii) given two networks, determine the functions for which the connectivity improves when we merge the second network into the first. Through these applications, we show that our approach is a natural alternative to network clustering algorithms.ConclusionsWe presented a novel approach to functional enrichment that takes into account the pairwise relationships among genes annotated by a particular function. Each of the three applications discovers highly relevant functions. We used our methods to study biological data from three different organisms. Our results demonstrate the wide applicability of our methods. Our algorithms are implemented in C++ and are freely available under the GNU General Public License at our supplementary website. Additionally, all our input data and results are available at http://bioinformatics.cs.vt.edu/~murali/supplements/2011-incob-nbe/.

Highlights

  • Many methods have been developed to infer and reason about molecular interaction networks

  • We presented a novel approach to functional enrichment that takes into account the pairwise relationships among genes annotated by a particular function

  • We discover Gene Ontology (GO) biological processes whose network-based enrichment improves when we add a collection of genetic interactions in S. cerevisiae that were identified in a large-scale study conducted by Krogan et al [22] to the BioGRID network [23]

Read more

Summary

Introduction

Many methods have been developed to infer and reason about molecular interaction networks. Considerable effort in molecular and cellular biology has been expended over the last 50 years by individual research groups on immunoprecipitation on a microarray (ChIP-on-chip) technology allows the detection of the targets of a specified transcription factor on a genome-wide scale [6] These developments have made molecular interaction networks pervasive in systems biology. Another broad class of methods overlay gene expression data for a condition on the wiring diagram to compute the cell’s response network for that condition [9,10,11] Networks of these types can contain hundreds or thousands of nodes and an order of magnitude more edges. When applied to reverse-engineered or response networks, a major drawback of functional enrichment is that it ignores information about the edges in the network being analyzed, i.e., it treats the network as a set of genes. It is difficult to interpret the relevance of that function to the network

Objectives
Methods
Results
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.