By Topic

Distributed Robust Biclustering Algorithm for Gene Expression Analysis

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Alain B. Tchagang ; Department of Biomedical Engineering, University of Minnesota, Minneapolis, 312 Church Street SE, Minneapolis, Minnesota, 55455, USA. ; Ahmed H. Tewfik

Show by Cheng and Church to be an NP-complex problem, biclustering algorithms are more complex than the classical one dimensional clustering technique, particularly requiring multiple computing platforms for large and distributed datasets. In this study, we proposed and extension of the robust biclustering algorithm (RoBA) that is capable of performing biclustering on extremely large or geographically distributed set of gene expression data. The distributed version will divide the cluster tasks among A' processors with negligible communication costs thus making it scalable over large number of computing nodes. The proposed algorithm has been implemented using Matlab MPI and the performance results are reported based on executions on a 1, 2, 3, 4, and 5 nodes Windows PC cluster connected over 100 Mbits links. The experimental results show increased performance with the increased number of nodes on the same set of data.

Published in:

2007 IEEE International Workshop on Genomic Signal Processing and Statistics

Date of Conference:

10-12 June 2007