Robust Detection of Hierarchical Communities from Escherichia coli Gene Expression Data

Abstract

Determining the functional structure of biological networks is a central goal of systems biology. One approach is to analyze gene expression data to infer a network of gene interactions on the basis of their correlated responses to environmental and genetic perturbations. The inferred network can then be analyzed to identify functional communities. However, commonly used algorithms can yield unreliable results due to experimental noise, algorithmic stochasticity, and the influence of arbitrarily chosen parameter values. Furthermore, the results obtained typically provide only a simplistic view of the network partitioned into disjoint communities and provide no information of the relationship between communities. Here, we present methods to robustly detect coregulated and functionally enriched gene communities and demonstrate their application and validity for Escherichia coli gene expression data. Applying a recently developed community detection algorithm to the network of interactions identified with the context likelihood of relatedness (CLR) method, we show that a hierarchy of network communities can be identified. These communities significantly enrich for gene ontology (GO) terms, consistent with them representing biologically meaningful groups. Further, analysis of the most significantly enriched communities identified several candidate new regulatory interactions. The robustness of our methods is demonstrated by showing that a core set of functional communities is reliably found when artificial noise, modeling experimental noise, is added to the data. We find that noise mainly acts conservatively, increasing the relatedness required for a network link to be reliably assigned and decreasing the size of the core communities, rather than causing association of genes into new communities.

Due to appear in PLoS Computational Biology. Supplementary Figure S1 was not uploaded but is available by contacting the author. 27 pages, 5 figures, 15 supplementary files

References in corpus (8)

• Modularity and community structure in networks
• Community detection in graphs
• Uncovering the overlapping community structure of complex networks in nature and society
• Near linear time algorithm to detect community structures in large-scale networks
• Resolution limit in community detection
• Quantifying social group evolution
• The performance of modularity maximization in practical contexts
• The Naming Game in Social Networks: Community Formation and Consensus Engineering

Cited by in corpus (6)

• Griffiths phases and the stretching of criticality in brain networks
• Frustrated hierarchical synchronization and emergent complexity in the human connectome network
• Network community detection using modularity density measures
• Fast and accurate determination of modularity and its effect size
• Finding network communities using modularity density
• Reduced network extremal ensemble learning (RenEEL) scheme for community detection in complex networks