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).

• PMID: 12169541
• 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, Non-P.H.S. | Validation Study

Authors

Tanay A, Sharan R, Shamir R

Primary Lit For

Additional Lit For

Review For