A Bottom-Up Approach to the Biclustering-Problem. (9th September 2008)

• Record Type: Journal Article
• Authors: Koh, Hyung-Won; Hildebrand, Lars
• Is Part Of: International journal of computational biology and drug design. Volume 1:Number 2(2008)
• Page Start: 158
• Page End: 173
• Publication Date: 2008-09-09
• Subjects: biclustering -- microarray analysis -- heuristics -- data mining -- data matrix -- bicluster sets; Computational biology -- Periodicals; Drugs -- Design -- Periodicals; 570.285
• Languages: English
• ISSNs: 1756-0756

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.