Discovering statistically significant biclusters in gene expression data

Abstract

In gene expression data, a bicluster is a subset of the genes exhibiting consistent patterns over a subset of the conditions. We propose a new method to detect significant biclusters in large expression datasets. Our approach is graph theoretic coupled with statistical modelling of the data. Under plausible assumptions, our algorithm is polynomial and is guaranteed to find the most significant biclusters. We tested our method on a collection of yeast expression profiles and on a human cancer dataset. Cross validation results show high specificity in assigning function to genes based on their biclusters, and we are able to annotate in this way 196 uncharacterized yeast genes. We also demonstrate how the biclusters lead to detecting new concrete biological associations. In cancer data we are able to detect and relate finer tissue types than was previously possible. We also show that the method outperforms the biclustering algorithm of Cheng and Church (2000).

Extracted Key Phrases

5 Figures and Tables

050100'01'03'05'07'09'11'13'15'17
Citations per Year

1,056 Citations

Semantic Scholar estimates that this publication has 1,056 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Tanay2002DiscoveringSS, title={Discovering statistically significant biclusters in gene expression data}, author={Amos Tanay and Roded Sharan and Ron Shamir}, journal={Bioinformatics}, year={2002}, volume={18 Suppl 1}, pages={S136-44} }