This article is part of the supplement: Selected papers from the Seventh Asia-Pacific Bioinformatics Conference (APBC 2009) .

Research

Semi-supervised gene shaving method for predicting low variation biological pathways from genome-wide data

Dongxiao Zhu^1,2

¹Department of Computer Science, University of New Orleans, New Orleans, LA 70148, USA

²Research Institute for Children, Children's Hospital, New Orleans, LA 70118, USA

author email corresponding author email

BMC Bioinformatics 2009, 10(Suppl 1):S54doi:10.1186/1471-2105-10-S1-S54

Published:	30 January 2009

Abstract

Background

The gene shaving algorithm and many other clustering algorithms identify gene clusters showing high variation across samples. However, gene expression in many signaling pathways show only modest and concordant changes that fail to be identified by these methods. The increasingly available signaling pathway prior knowledge provide new opportunity to solve this problem.

Results

We propose an innovative semi-supervised gene clustering algorithm, where the original gene shaving algorithm was extended and generalized so that prior knowledge of signaling pathways can be incorporated. Different from other methods, our method identifies gene clusters showing concerted and modest expression variation as well as strong expression correlation. Using available pathway gene sets as prior knowledge, whether complete or incomplete, our algorithm is capable of forming tightly regulated gene clusters showing modest variation across samples. We demonstrate the advantages of our algorithm over the original gene shaving algorithm using two microarray data sets. The stability of the gene clusters was accessed using a jackknife approach.

Conclusion

Our algorithm represents one of the first clustering algorithms that is particularly designed to identify signaling pathways of low and concordant gene expression variation. The discriminating power is achieved by manufacturing a principal component enriched by signaling pathways.