GPU-Based Biclustering for Neural Information Processing

  • Alan W. Y. Lo
  • Benben Liu
  • Ray C. C. Cheung
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7667)


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.


High Performance Computing (HPC) Biclustering Graphics Processing Unit (GPU) 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Golub, T.R., Slonim, D.K., Tamayo, P., Huard, C., Gaasenbeek, M., Mesirov, J.P., Coller, H., Loh, M.L., Downing, J.R., Caligiuri, M.A., Bloomfield, C.D., Lander, E.S.: Molecular Classification of Cancer: Class Discovery and Class Prediction by Gene Expression Monitoring. Science 286(5439), 531–537 (1999)CrossRefGoogle Scholar
  2. 2.
    Dhillon, I.S., Mallela, S., Modha, D.S.: Information-Theoretic Co-clustering, pp. 89–98 (2003)Google Scholar
  3. 3.
    Gan, X., Liew, A.W.C., Yan, H.: Discovering Biclusters in Gene Expression Data based on High-Dimensional Linear Geometries. BMC Bioinformatics 9(1), 209 (2008)CrossRefGoogle Scholar
  4. 4.
    Zhao, H., Liew, A.W.C., Xie, X., Yan, H.: A New Geometric Biclustering Algorithm based on the Hough Transform for Analysis of Large-scale Microarray Data. Journal of Theoretical Biology 251(3), 264–274 (2008)CrossRefGoogle Scholar
  5. 5.
    Wang, D.Z., Yan, H.: Geometric Biclustering Analysis of DNA Microarray Data based on Hypergraph Partitioning. In: IDASB Workshop on BIBM 2010, pp. 246–251 (2010)Google Scholar
  6. 6.
    Karypis, G., Kumar, V.: Multilevel K-Way Hypergraph PartitioningGoogle Scholar
  7. 7.
    Thomas, D.B., Howes, L.W., Luk, W.: A Comparison of CPUs, GPUs, FPGAs, and Massively Parallel Processor Arrays for Random Number Generation. In: Proc. FPGA, pp. 63–72 (2009)Google Scholar
  8. 8.
    Labiod, L., Grozavu, N., Bennani, Y.: Clustering Categorical Data Using an Extended Modularity Measure, pp. 310–320 (2010)Google Scholar
  9. 9.
    Cheng, Y., Church, G.M.: Biclustering of Expression Data. In: The Eighth International Conference on Intelligent Systems for Molecular Biology, pp. 93–103 (2000)Google Scholar
  10. 10.
    Madeira, S.C., Oliveira, A.L.: Biclustering Algorithms for Biological Data Analysis: A Survey. IEEE/ACM Transactions on Computational Biology and Bioinformatic. 1, 24–45 (2004)CrossRefGoogle Scholar
  11. 11.
    Schatz, M., Trapnell, C., Delcher, A., Varshney, A.: High-Throughput Sequence Alignment Using Graphics Processing Units. BMC Bioinformatics 8(1), 474 (2007)CrossRefGoogle Scholar
  12. 12.
    Manavski, S., Valle, G.: CUDA Compatible GPU Cards as Efficient Hardware Accelerators for Smith-Waterman Sequence Alignment. BMC Bioinformatics 9(suppl. 2), S10 (2008)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Alan W. Y. Lo
    • 1
  • Benben Liu
    • 1
  • Ray C. C. Cheung
    • 1
  1. 1.Department of Electronic EngineeringCity University of Hong KongHong Kong

Personalised recommendations