Biclustering aims to mine a number of co-expressed genes under a set of experimental conditions in gene expression dataset. Recently, differential co-expression biclustering approach has been used to identify class-specific biclusters between two gene expres- sion datasets. However, it cannot handle differential co-expression constant row biclusters efficiently in real-valued datasets. In this paper, we propose an algorithm, DRCluster, to identify Differential co-expression constant Row biCluster in two real-valued gene expression datasets. Firstly, DRCluster infers the differential co-expressed genes from each pair of samples in two real-valued gene expression datasets, and constructs a differential weighted undirected sample-sample relational graph. Secondly, the differential co- expression constant row biclusters are produced in the above differential weighted undirected sample-sample relational graph. We also design several pruning techniques for mining maximal differential co-expression constant row biclusters without candidate mainte- nance. The experimental results show our algorithm is more efficient than existing one. The performance of DRCluster is evaluated by MSE score and Gene Ontology, the results show our algorithm can find more significant and biological differential biclusters than traditional algorithm.
Wang, Miao; Shang, Xuequn; Li, Xiaoyuan; Li, Zhanhuai; and Liu, Wenbin
"Efficient Mining Differential Co-Expression Constant Row Bicluster in Real-Valued Gene Expression Datasets,"
Applied Mathematics & Information Sciences: Vol. 07:
2, Article 22.
Available at: https://digitalcommons.aaru.edu.jo/amis/vol07/iss2/22