A Bottom-Up Approach to the Biclustering-Problem
by Hyung-Won Koh, Lars Hildebrand
International Journal of Computational Biology and Drug Design (IJCBDD), Vol. 1, No. 2, 2008

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.

Online publication date: Mon, 08-Sep-2008

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Biology and Drug Design (IJCBDD):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com