Including transcription factor information in the superparamagnetic clustering of microarray data

In this work, we modify the superparamagnetic clustering algorithm (SPC) by adding an extra weight to the interaction formula that considers which genes are regulated by the same transcription factor. With this modified algorithm that we call SPCTF, we analyze Spellman et al. microarray data for cel...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Monsivais-Alonso, M P, Navarro-Munoz, J C, Riego-Ruiz, L, Lopez-Sandoval, R, Rosu, H C
Format Paper Journal Article
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 22.12.2010
Subjects
Online AccessGet full text
ISSN2331-8422
DOI10.48550/arxiv.1012.5063

Cover

More Information
Summary:In this work, we modify the superparamagnetic clustering algorithm (SPC) by adding an extra weight to the interaction formula that considers which genes are regulated by the same transcription factor. With this modified algorithm that we call SPCTF, we analyze Spellman et al. microarray data for cell cycle genes in yeast, and find clusters with a higher number of elements compared with those obtained with the SPC algorithm. Some of the incorporated genes by using SPCFT were not detected at first by Spellman et al. but were later identified by other studies, whereas several genes still remain unclassified. The clusters composed by unidentified genes were analyzed with MUSA, the motif finding using an unsupervised approach algorithm, and this allow us to select the clusters whose elements contain cell cycle transcription factor binding sites as clusters worth of further experimental studies because they would probably lead to new cell cycle genes. Finally, our idea of introducing available information about transcription factors to optimize the gene classification could be implemented for other distance-based clustering algorithms
Bibliography:SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
content type line 50
ISSN:2331-8422
DOI:10.48550/arxiv.1012.5063