A Bottom-Up Approach to the Biclustering-Problem
International Journal of Computational Biology and Drug Design · 2008
DOI: 10.1504/ijcbdd.2008.020207 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal of Computational Biology and Drug Design, 2008. Verfasst von Hyung-Won Koh und 1 weiteren Autor:innen. Beteiligte Einrichtung: ISAS - Institute for Analytical Sciences, Dortmund, Germany. koh@isas.de. Hauptthemen laut MEDLINE: Algorithms. Die Arbeit wurde bisher 1-mal zitiert (Crossref).
Abstract (Originalsprache)
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.
Schlagwörter
MeSH-Schlagwörter (MEDLINE)
Autor:innen und Institutionen
- ISAS - Institute for Analytical Sciences, Dortmund, Germany. koh@isas.de
Zitieren
APA
Koh, H. W., & Hildebrand, L. (2008). A Bottom-Up Approach to the Biclustering-Problem. International Journal of Computational Biology and Drug Design. https://doi.org/10.1504/ijcbdd.2008.020207
Vancouver
Koh HW, Hildebrand L. A Bottom-Up Approach to the Biclustering-Problem. International Journal of Computational Biology and Drug Design. 2008. doi:10.1504/ijcbdd.2008.020207
BibTeX
@article{Koh2008,
author = {Koh, Hyung-Won and Hildebrand, Lars},
title = {A Bottom-Up Approach to the Biclustering-Problem},
journal = {International Journal of Computational Biology and Drug Design},
year = {2008},
doi = {10.1504/ijcbdd.2008.020207}
}
EUVIMED