Difference-based clustering of short time-course microarray data with replicates.
BACKGROUND
There are some limitations associated with conventional clustering methods for short time-course gene expression data. The current algorithms require prior domain knowledge and do not incorporate information from replicates. Moreover, the results are not always easy to interpret biologically.


RESULTS
We propose a novel algorithm for identifying a subset of genes sharing a significant temporal expression pattern when replicates are used. Our algorithm requires no prior knowledge, instead relying on an observed statistic which is based on the first and second order differences between adjacent time-points. Here, a pattern is predefined as the sequence of symbols indicating direction and the rate of change between time-points, and each gene is assigned to a cluster whose members share a similar pattern. We evaluated the performance of our algorithm to those of K-means, Self-Organizing Map and the Short Time-series Expression Miner methods.


CONCLUSIONS
Assessments using simulated and real data show that our method outperformed aforementioned algorithms. Our approach is an appropriate solution for clustering short time-course microarray data with replicates.
Kim
Jihoon
J
Seoul National University Biomedical Informatics, Seoul National University College of Medicine, Seoul, Korea. jihoon@stat.wisc.edu <jihoon@stat.wisc.edu>
Kim
Ju Han
JH
D000465:Algorithms; D001185:Artificial Intelligence; D016000:Cluster Analysis; D020869:Gene Expression Profiling / Q000379:methods*; D020411:Oligonucleotide Array Sequence Analysis / Q000379:methods*; D010363:Pattern Recognition, Automated / Q000379:methods*; D013997:Time Factors