Biclustering is an important approach in microarray data analysis. Using biclustering algorithms, one can identify sets of genes sharing compatible expression patterns across subsets of samples. These patterns may provide clues about the main biological processes associated to different physiological states. In this study, we present a new biclustering algorithm to identify local structures from gene expression data set. Our method uses singular value decomposition (SVD) as its framework. Based on the singular value decomposition, identifying bicluster problem from gene expression matrix is transformed into two global clustering problems. After biclustering, our algorithm forms blocks of up-regulated or down-regulated in gene expression matrix, so as to infer that which genes are co-regulated and which genes possibly are functionally related. The experimental results on three benchmark datasets (Human Tissues, Lymphoma, Leukemia) demonstrate good visualization and interpretation ability. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Yang, W. H., Dai, D. Q., & Yan, H. (2007). Biclustering of microarray data based on singular value decomposition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4819 LNAI, pp. 194–205). Springer Verlag. https://doi.org/10.1007/978-3-540-77018-3_21
Mendeley helps you to discover research relevant for your work.