Difference-based clustering of short time-course microarray data with replicates
2007

New Clustering Method for Gene Expression Data

Sample size: 2179 publication 10 minutes Evidence: high

Author Information

Author(s): Kim Jihoon, Kim Ju Han

Primary Institution: Seoul National University Biomedical Informatics

Hypothesis

Can a difference-based clustering algorithm improve the analysis of short time-course microarray data with replicates?

Conclusion

The proposed DIB-C algorithm outperformed traditional clustering methods in analyzing short time-course microarray data.

Supporting Evidence

  • DIB-C showed better accuracy across cluster numbers compared to K-means, SOM, and STEM methods.
  • DIB-C produced the largest Z-score of 3.247 at 28 clusters, indicating significant clustering results.
  • The algorithm effectively utilized replicate data to enhance clustering accuracy.

Takeaway

This study created a new way to group genes based on how their activity changes over time, which helps scientists understand gene behavior better.

Methodology

The study developed a difference-based clustering algorithm (DIB-C) that uses first- and second-order differences in gene expression data to form clusters without prior knowledge.

Potential Biases

Potential bias in clustering results due to the reliance on empirical Bayes methods and the choice of filtering criteria.

Limitations

The algorithm may not perform well with datasets that have a very high number of time-points due to increased runtime.

Participant Demographics

The study analyzed gene expression data from pancreas gene expression in developing mice.

Statistical Information

P-Value

p<0.05

Digital Object Identifier (DOI)

10.1186/1471-2105-8-253

Want to read the original?

Access the complete publication on the publisher's website

View Original Publication