Discovering Coherent Biclusters from Gene Expression Data Using Zero-Suppressed Binary Decision Diagrams
Issue No. 04 - October-December (2005 vol. 2)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2005.55
<p><b>Abstract</b>—The biclustering method can be a very useful analysis tool when some genes have multiple functions and experimental conditions are diverse in gene expression measurement. This is because the biclustering approach, in contrast to the conventional clustering techniques, focuses on finding a subset of the genes and a subset of the experimental conditions that together exhibit coherent behavior. However, the biclustering problem is inherently intractable, and it is often computationally costly to find biclusters with high levels of coherence. In this work, we propose a novel biclustering algorithm that exploits the <it>zero-suppressed binary decision diagrams</it> (ZBDDs) data structure to cope with the computational challenges. Our method can find all biclusters that satisfy specific input conditions, and it is scalable to practical gene expression data. We also present experimental results confirming the effectiveness of our approach.</p>
Clustering, life and medical sciences, bioinformatics (genome or protein) databases, logic design.
L. Benini, C. Nardini, S. Yoon and G. De Micheli, "Discovering Coherent Biclusters from Gene Expression Data Using Zero-Suppressed Binary Decision Diagrams," in IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 2, no. , pp. 339-354, 2005.