Motivation: Large-scale gene expression data comprising a variety of cellular conditions hold the promise of a global view on the transcription program. While conventional clustering algorithms have been successfully applied to smaller datasets, the utility of many algorithms for the analysis of large-scale data is limited by their inability to capture combinatorial and condition-specific co-regulation. In addition, there is an increasing need to integrate the rapidly accumulating body of other high-throughput biological data with the expression analysis. In a previous work, we introduced the signature algorithm, which overcomes the problems of conventional clustering and allows for intuitive integration of additional biological data. However, this approach is constrained by the comprehensiveness of relevant external data and its lacking ability to capture hierarchical modularity.

Methods: We present a novel method for the analysis of large-scale expression data, which assigns genes into context-dependent and potentially overlapping regulatory units. We introduce the notion of a transcription module as a self-consistent regulatory unit consisting of a set of co-regulated genes as well as the experimental conditions that induce their co-regulation. Self-consistency is defined by a rigorous mathematical criterion. We propose an efficient algorithm to identify such modules, which is based on the iterative application of the signature algorithm. A threshold parameter that determines the resolution of the modular decomposition is introduced.

Results: The method is applied systematically to over 1000 expression profiles of the yeast Saccharomyces cerevisiae, and the results are presented using two complementary visualization schemes we developed. The average biological coherence, as measured by the conservation of putative cis-regulatory motifs between four related yeast species, is higher for transcription modules than for clusters identified by other methods applied to the same dataset. Our method is related to singular value decomposition (SVD) and to the pairwise average linkage clustering algorithm. It extends SVD by filtering out noise in the expression data and offering variable resolution to reveal hierarchical organization. It furthermore has the advantage over both methods of capturing overlapping modules in the presence of combinatorial regulation.

Supplementary information: http://www.weizmann.ac.il/~barkai/modules

• PMID: 15044247
• DOI full text
• PubMed

Reference Type

Comparative Study | Evaluation Study | Journal Article | Research Support, Non-U.S. Gov't | Research Support, U.S. Gov't, P.H.S. | Validation Study

Authors

Ihmels J, Bergmann S, Barkai N

Primary Lit For

Additional Lit For

Review For