.png){kind=icon}
.png){kind=icon}
Return
BiMine+: An efficient algorithm for discovering relevant biclusters of DNA microarray data
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2012.04.017.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Biclustering is a very useful tool for analyzing microarray data. It aims to identify maximal groups of genes which are coherent with maximal groups of conditions. In this paper, we propose a biclustering algorithm, called BiMine+, which is able to detect significant biclusters from gene expression data. The proposed algorithm is based on two original features. First, BiMine+ is based on the use of a new tree structure, called Modified Bicluster Enumeration Tree (MBET), on which biclusters are represented by the profile shapes of genes. Second, BiMine+ uses a pruning rule to avoid both trivial biclusters and combinatorial explosion of the search tree. The performance of BiMine+ is assessed on both synthetic and real DNA microarray datasets. Experimental results show that BiMine+ competes favorably with several state-of-the-art biclustering algorithms and is able to extract functionally enriched and biologically relevant biclusters. (C) 2012 Elsevier B.V. All rights reserved.
Keywords:
Biclustering
Gene expression data
Evaluation function
Enumeration algorithm
Data mining
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.