A Method for Clustering Gene Expression Data Based on Graph Structure

Shigeto Seno[1] (s-senoo@ist.osaka-u.ac.jp)
Reiji Teramoto[2] (teramoto@sumitomopharm.co.jp)
Yoichi Takenaka[1] (takenaka@ist.osaka-u.ac.jp)
Hideo Matsuda[1] (matsuda@ist.osaka-u.ac.jp)

[1]Department of Bioinformatic Engineering, Graduate School of Information Science and Technology, Osaka University, 1-3 Machikaneyama, Toyonaka, Osaka 560-8531, Japan
[2]Genomic Science Laboratories, Research Division, Sumitomo Pharmaceuticals Co., Ltd., 3-1-98 Kasugade Naka, Konohana-ku, Osaka 554-0022, Japan


Recently, gene expression data under various conditions have largely been obtained by the utilization of the DNA microarrays and oligonucleotide arrays. There have been emerging demands to analyze the function of genes from the gene expression profiles. For clustering genes from their expression profiles, hierarchical clustering has been widely used. The clustering method represents the relationships of genes as a tree structure by connecting genes using their similarity scores based on the Pearson correlation coefficient. But the clustering method is sensitive to experimental noise. To cope with the problem, we propose another type of clustering method (the p-quasi complete linkage clustering). We apply this method to the gene expression data of yeast cell-cycles and human lung cancer. The effectiveness of our method is demonstrated by comparing clustering results with other methods.

[ Full-text PDF | Table of Contents ]

Japanese Society for Bioinformatics