The Community for Technology Leaders
Green Image
Clustering of genes into groups sharing common characteristics is a useful exploratory technique for a number of subsequent computational analysis. A wide range of clustering algorithms have been proposed in particular to analyze gene expression data, but most of them consider genes as independent entities or include relevant information on gene interactions in a suboptimal way. We propose a probabilistic model that has the advantage to account for individual data (e.g., expression) and pairwise data (e.g., interaction information coming from biological networks) simultaneously. Our model is based on hidden Markov random field models in which parametric probability distributions account for the distribution of individual data. Data on pairs, possibly reflecting distance or similarity measures between genes, are then included through a graph, where the nodes represent the genes, and the edges are weighted according to the available interaction information. As a probabilistic model, this model has many interesting theoretical features. In addition, preliminary experiments on simulated and real data show promising results and points out the gain in using such an approach. Availability: The software used in this work is written in C++ and is available with other supplementary material at
Markov random fields, model-based clustering, metabolic networks, gene expression.
Matthieu Vignes, Florence Forbes, "Gene Clustering via Integrated Markov Models Combining Individual and Pairwise Features", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 6, no. , pp. 260-270, April-June 2009, doi:10.1109/TCBB.2007.70248
94 ms
(Ver 3.1 (10032016))