Skip to content
naulon

Not checkedNot checked for notices yet.

Discovery of error-tolerant biclusters from noisy gene expression data

Gupta Rohit, Rao Navneet, Kumar Vipin

BMC Bioinformatics · 2011

doi:10.1186/1471-2105-12-s12-s1 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

<p>Abstract</p> <p>Background</p> <p>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.</p> <p>Results</p> <p>In this paper, we first propose a novel error-tolerant biclustering model, ‘<it>ET-bicluster</it>’, 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 <it>RAP</it> in the context of two biological problems: discovery of functional modules and discovery of biomarkers. For the first problem, two real-valued <it>S.Cerevisiae</it> microarray gene-expression data sets are used to demonstrate that the biclusters obtained from <it>ET-bicluster</it> approach not only recover larger set of genes as compared to those obtained from <it>RAP</it> 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 <it>Breast Cancer</it> microarray gene-expression data sets and evaluate the biomarkers obtained using MSigDB gene sets.</p> <p>Conclusions</p> <p>The results obtained for both the problems: functional module discovery and biomarkers discovery, clearly signifies the usefulness of the proposed <it>ET-bicluster</it> approach and illustrate the importance of explicitly incorporating noise/errors in discovering coherent groups of genes from gene-expression data.</p>

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.