Uncovering transcriptional regulatory networks by sparse Bayesian factor model

  • Authors:
  • Jia Meng;Jianqiu Zhang;Yuan Qi;Yidong Chen;Yufei Huang

  • Affiliations:
  • Department of Electrical and Computer Engineering, University of Texas at San Antonio, San Antonio, TX;Department of Electrical and Computer Engineering, University of Texas at San Antonio, San Antonio, TX;Departments of Computer Science and Statistics, Purdue University, West Lafayette, IN;Department of Epidemiology and Biostatistics, UT Health Science Center at San Antonio, San Antonio, TX and Greehey Children's Cancer Research Institute, UT Health Science Center at San Antonio, Sa ...;Dept. of Electrical and Comp. Eng., Univ. of Texas at San Antonio, San Antonio, TX and Dept. of Epidemiology and Biostatistics, UT Health Science Center at San Antonio, TX and Greehey Children's C ...

  • Venue:
  • EURASIP Journal on Advances in Signal Processing - Special issue on genomic signal processing
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

The problem of uncovering transcriptional regulation by transcription factors (TFs) based on microarray data is considered. A novel Bayesian sparse correlated rectified factor model (BSCRFM) is proposed that models the unknown TF protein level activity, the correlated regulations between TFs, and the sparse nature of TF-regulated genes. The model admits prior knowledge from existing database regarding TF-regulated target genes based on a sparse prior and through a developed Gibbs sampling algorithm, a context-specific transcriptional regulatory network specific to the experimental condition of the microarray data can be obtained. The proposed model and the Gibbs sampling algorithm were evaluated on the simulated systems, and results demonstrated the validity and effectiveness of the proposed approach. The proposed model was then applied to the breast cancer microarray data of patients with Estrogen Receptor positive (ER+) status and Estrogen Receptor negative (ER-) status, respectively.