An algorithm to infer similarity among cell types and organisms by examining the most expressed sequences

S.A.P. Pinto, J.M. Ortega
Published: September 30, 2008
Genet. Mol. Res. 7 (3) : 933-947
DOI: https://doi.org/10.4238/vol7-3x-meeting010

Cite this Article:
S.A.P. Pinto, J.M. Ortega (2008). An algorithm to infer similarity among cell types and organisms by examining the most expressed sequences. Genet. Mol. Res. 7(3): 933-947. https://doi.org/10.4238/vol7-3x-meeting010

About the Authors
S.A.P. Pinto, J.M. Ortega

Corresponding Author
J.M. Ortega
Email: miguel@icb.ufmg.br

ABSTRACT

Following sequence alignment, clustering algorithms are among the most utilized techniques in gene expression data analysis. Clustering gene expression patterns allows researchers to determine which gene expression patterns are alike and most likely to participate in the same biological process being investigated. Gene expression data also allow the clustering of whole samples of data, which makes it possible to find which samples are similar and, consequently, which sampled biological conditions are alike. Here, a novel similarity measure calculation and the resulting rank-based clustering algorithm are presented. The clustering was applied in 418 gene expression samples from 13 data series spanning three model organisms: Homo sapiensMus musculus, and Arabidopsis thaliana. The initial results are striking: more than 91% of the samples were clustered as expected. The MESs (most expressed sequences) approach outperformed some of the most used clustering algorithms applied to this kind of data such as hierarchical clustering and K-means. The clustering performance suggests that the new similarity measure is an alternative to the traditional correlation/distance measures typically used in clustering algorithms.

Key words: Gene expression, Clustering, Similarity measure, Most expressed sequences.

Back To Top