Approximation Algorithms for Biclustering Problems

One of the main goals in the analysis of microarray data is to identify groups of genes and groups of experimental conditions (including environments, individuals, and tissues) that exhibit similar expression patterns. This is the so-called biclustering problem. In this paper, we consider two variations of the biclustering problem: the consensus submatrix problem and the bottleneck submatrix problem. The input of the problems contains an m

• Type: Journal
• Year: 2008
• Where: SIAMCOMP
• Authors: Lusheng Wang, Yu Lin, Xiaowen Liu
• Keywords: Bottleneck Submatrix Problem, Consensus Submatrix Problem, SIAMCOMP 2008, Submatrix Problem