title: Discovery of error-tolerant biclusters from noisy gene expression data.
abstract: BACKGROUND
  An important analysis performed on microarray gene-expression data is to discover biclusters, which denote groups of genes that are coherently expressed for a subset of conditions. Various biclustering algorithms have been proposed to find different types of biclusters from these real-valued gene-expression data sets. However, these algorithms suffer from several limitations such as inability to explicitly handle errors/noise in the data; difficulty in discovering small bicliusters due to their top-down approach; inability of some of the approaches to find overlapping biclusters, which is crucial as many genes participate in multiple biological processes. Association pattern mining also produce biclusters as their result and can naturally address some of these limitations. However, traditional association mining only finds exact biclusters, which limits its applicability in real-life data sets where the biclusters may be fragmented due to random noise/errors. Moreover, as they only work with binary or boolean attributes, their application on gene-expression data require transforming real-valued attributes to binary attributes, which often results in loss of information. Many past approaches have tried to address the issue of noise and handling real-valued attributes independently but there is no systematic approach that addresses both of these issues together.
  
  
  RESULTS
  In this paper, we first propose a novel error-tolerant biclustering model, 'ET-bicluster', and then propose a bottom-up heuristic-based mining algorithm to sequentially discover error-tolerant biclusters directly from real-valued gene-expression data. The efficacy of our proposed approach is illustrated by comparing it with a recent approach RAP in the context of two biological problems: discovery of functional modules and discovery of biomarkers. For the first problem, two real-valued S.Cerevisiae microarray gene-expression data sets are used to demonstrate that the biclusters obtained from ET-bicluster approach not only recover larger set of genes as compared to those obtained from RAP approach but also have higher functional coherence as evaluated using the GO-based functional enrichment analysis. The statistical significance of the discovered error-tolerant biclusters as estimated by using two randomization tests, reveal that they are indeed biologically meaningful and statistically significant. For the second problem of biomarker discovery, we used four real-valued Breast Cancer microarray gene-expression data sets and evaluate the biomarkers obtained using MSigDB gene sets.
  
  
  CONCLUSIONS
  The results obtained for both the problems: functional module discovery and biomarkers discovery, clearly signifies the usefulness of the proposed ET-bicluster approach and illustrate the importance of explicitly incorporating noise/errors in discovering coherent groups of genes from gene-expression data.
authors.affiliation: Department of Computer Science, University of Minnesota - Twin Cities, Minneapolis, MN 55455, USA. rohit@cs.umn.edu
authors.forename: Rohit
authors.initials: R
authors.lastname: Gupta
authors.forename: Navneet
authors.initials: N
authors.lastname: Rao
authors.forename: Vipin
authors.initials: V
authors.lastname: Kumar
mesh_terms: D000465:Algorithms; D001943:Breast Neoplasms / Q000235:genetics; D016000:Cluster Analysis; D005260:Female; D020869:Gene Expression Profiling / Q000379:methods*; D006801:Humans; D020411:Oligonucleotide Array Sequence Analysis / Q000379:methods; D012441:Saccharomyces cerevisiae / Q000235:genetics