Authors: Hyung-Won Koh, Lars Hildebrand
Addresses: ISAS – Institute for Analytical Sciences, Dortmund, Germany. ' University of Dortmund, Dortmund, Germany
Abstract: The biclustering problem adresses the discovery of locally significant correlation within a data matrix and has recently become quite popular in the field of microarray data analysis. The preservation of a particularly defined degree of homogeneity between elements within a bicluster plays a key role in the search procedure. This work proposes a pairwise distance function related to the mean squared residue to introduce multiple enrichment algorithms. Based on a theoretical framework, the impact is demonstrated empirically by the enrichment of commonly available and also on artificially generated bicluster sets.
Keywords: biclustering; microarray analysis; heuristics; data mining; data matrix; bicluster sets.
International Journal of Computational Biology and Drug Design, 2008 Vol.1 No.2, pp.158 - 173
Available online: 08 Sep 2008 *Full-text access for editors Access for subscribers Purchase this article Comment on this article