Correction: Module Discovery by Exhaustive Search for Densely Connected, Co-Expressed Regions in Biomolecular Interaction Networks.

Background: Computational prediction of functionally related groups of genes (functional modules) from large-scale data is an important issue in computational biology.Gene expression experiments and interaction networks are well studied largescale data sources, available for many not yet exhaustively annotated organisms.It has been well established, when analyzing these two data sources jointly, modules are often reflected by highly interconnected (dense) regions in the interaction networks whose participating genes are co-expressed.However, the tractability of the problem had remained unclear and methods by which to exhaustively search for such constellations had not been presented. Methodology/Principal Findings:We provide an algorithmic framework, referred to as Densely Connected Biclustering (DECOB), by which the aforementioned search problem becomes tractable.To benchmark the predictive power inherent to the approach, we computed all co-expressed, dense regions in physical protein and genetic interaction networks from human and yeast.An automatized filtering procedure reduces our output which results in smaller collections of modules, comparable to state-of-the-art approaches.Our results performed favorably in a fair benchmarking competition which adheres to standard criteria.We demonstrate the usefulness of an exhaustive module search, by using the unreduced output to more quickly perform GO term related function prediction tasks.We point out the advantages of our exhaustive output by predicting functional relationships using two examples.Conclusion/Significance: We demonstrate that the computation of all densely connected and co-expressed regions in interaction networks is an approach to module discovery of considerable value.Beyond confirming the well settled hypothesis that such co-expressed, densely connected interaction network regions reflect functional modules, we open up novel computational ways to comprehensively analyze the modular organization of an organism based on prevalent and largely available large-scale datasets.

Abstract licence: CC BY

1. 7.

   Evaluation of clustering algorithms for protein-protein interaction networks · 2006

2. 8.

   Identification of functional modules using network topology and high-throughput data · 2007

3. 37.

   GoMiner: a resource for biological interpretation of genomic and proteomic data · 2003

55 more references, whose wording the paper’s licence keeps private.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.