GPU-Based Biclustering for Neural Information Processing

This paper presents an efficient mapping of geometric biclustering (GBC) algorithm for neural information processing on Graphical Processing Unit (GPU). The proposed designs consist of five different versions which extensively study the use of memory components on the GPU board for mapping the GBC algorithm. GBC algorithm is used to find any maximal biclusters, which are common patterns in each column in the neural processing and gene microarray data. A microarray commonly involves a huge number of data, such as thousands of rows by thousands of columns so that finding the maximal biclusters involves intensive computation. The advantage of GPU is its ability of parallel computing which means that for those independent procedures, they can be carried out at the same time. Experimental results show that the GPU-based GBC could reduce the processing time largely due to the parallel computing of GPU, and its scalability. As an example, GBC algorithm involves a large number of AND operations which utilize the parallel GPU computations, that can be further practically used for other neural processing algorithms.

[1]  George M. Church,et al.  Biclustering of Expression Data , 2000, ISMB.

[2]  Younès Bennani,et al.  Clustering Categorical Data Using an Extended Modularity Measure , 2010, ICONIP.

[3]  Inderjit S. Dhillon,et al.  Information-theoretic co-clustering , 2003, KDD '03.

[4]  Fang Zhou,et al.  QTL mapping arthritis traits in CXB mice , 2008, BMC Bioinformatics.

[5]  Vipin Kumar,et al.  Multilevel k-way hypergraph partitioning , 1999, DAC '99.

[6]  Hong Yan,et al.  Discovering biclusters in gene expression data based on high-dimensional linear geometries , 2008, BMC Bioinformatics.

[7]  J. Mesirov,et al.  Molecular classification of cancer: class discovery and class prediction by gene expression monitoring. , 1999, Science.

[8]  Giorgio Valle,et al.  CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment , 2008, BMC Bioinformatics.

[9]  Arlindo L. Oliveira,et al.  Biclustering algorithms for biological data analysis: a survey , 2004, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[10]  Amitabh Varshney,et al.  High-throughput sequence alignment using Graphics Processing Units , 2007, BMC Bioinformatics.

[11]  Hong Yan,et al.  A new geometric biclustering algorithm based on the Hough transform for analysis of large-scale microarray data. , 2008, Journal of theoretical biology.

[12]  Wayne Luk,et al.  A comparison of CPUs, GPUs, FPGAs, and massively parallel processor arrays for random number generation , 2009, FPGA '09.

[13]  Hong Yan,et al.  Geometric biclustering analysis of DNA microarray data based on hypergraph partitioning , 2010, 2010 IEEE International Conference on Bioinformatics and Biomedicine Workshops (BIBMW).