Distributed Robust Biclustering Algorithm for Gene Expression Analysis
- 1 June 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21503001,p. 1-4
Abstract
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.Keywords
This publication has 7 references indexed in Scilit:
- Parallel identification of gene biclusters with coherent evolutionsIEEE Transactions on Signal Processing, 2006
- Robust biclustering algorithm (ROBA) for DNA microarray data analysis2005
- Biclustering algorithms for biological data analysis: a surveyIEEE/ACM Transactions on Computational Biology and Bioinformatics, 2004
- Enhanced biclustering on expression data2003
- Iterative signature algorithm for the analysis of large-scale gene expression dataPhysical Review E, 2003
- Discovering statistically significant biclusters in gene expression dataBioinformatics, 2002
- Missing value estimation methods for DNA microarraysBioinformatics, 2001