Abstract

We present a novel approach to the clustering of gene expression patterns based on the mutual connectivity of the patterns. Unlike certain widely used methods (e.g., self-organizing maps and K-means) which essentially force gene expression data into a fixed number of predetermined clustering structures, our approach aims to reveal the natural tendency of the data to cluster, in analogy to the physical phenomenon of percolation. The approach is probabilistic in nature, and as such accommodates the possibility that one gene participates in multiple clusters. The result is cast in terms of the connectivity of each gene to a certain number of (significant) clusters. A computationally efficient algorithm is developed to implement our approach. Performance of the method is illustrated by clustering both constructed data and gene expression data obtained from Dictyostelium development.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.