Biclustering of gene expression data based on GRASP-like algorithms

Aim of clustering of data is to analyze gene expression data. Recently, biclustering or simultaneous clustering of both genes and conditions have generated considerable interest over the past few decades, particularly related to the analysis of high-dimensional gene expression data in information retrieval, knowledge discovery, and data mining. In a gene expression data matrix, a bicluster is a submatrix of genes and conditions that exhibits a high correlation of expression activity across both rows and columns. Unfortunately, the problem of locating the most significant bicluster has been shown to be NP-complete. Therefore, given the inner “intractability” of the problem from a computational point of view, we have designed and implemented several GRASP-like heuristic algorithms to efficiently find good solutions in a reasonable running times.