A GPU-accelerated algorithm for biclustering analysis and detection of condition-dependent coexpression network modules

• Published in: Scientific reports Vol. 7; no. 1; pp. 4162 - 9
• Main Authors: Bhattacharya, Anindya, Cui, Yan
• Format: Journal Article
• Language: English
• Published: London Nature Publishing Group UK 23.06.2017; Nature Publishing Group; Nature Portfolio
• Subjects: 38/61; 631/114/1305; 631/114/2404; Algorithms; Animals; Cluster Analysis; Computer Graphics; Databases, Genetic; Gene expression; Gene Expression Regulation; Gene Regulatory Networks; Humanities and Social Sciences; Humans; multidisciplinary; Rats; Science; Science (multidisciplinary)
• ISSN: 2045-2322; 2045-2322
• DOI: 10.1038/s41598-017-04070-4

In the analysis of large-scale gene expression data, it is important to identify groups of genes with common expression patterns under certain conditions. Many biclustering algorithms have been developed to address this problem. However, comprehensive discovery of functionally coherent biclusters from large datasets remains a challenging problem. Here we propose a GPU-accelerated biclustering algorithm, based on searching for the largest Condition-dependent Correlation Subgroups (CCS) for each gene in the gene expression dataset. We compared CCS with thirteen widely used biclustering algorithms. CCS consistently outperformed all the thirteen biclustering algorithms on both synthetic and real gene expression datasets. As a correlation-based biclustering method, CCS can also be used to find condition-dependent coexpression network modules. We implemented the CCS algorithm using C and implemented the parallelized CCS algorithm using CUDA C for GPU computing. The source code of CCS is available from https://github.com/abhatta3/Condition-dependent-Correlation-Subgroups-CCS.