title: Factor analysis for gene regulatory networks and transcription factor activity profiles.
abstract: BACKGROUND
  Most existing algorithms for the inference of the structure of gene regulatory networks from gene expression data assume that the activity levels of transcription factors (TFs) are proportional to their mRNA levels. This assumption is invalid for most biological systems. However, one might be able to reconstruct unobserved activity profiles of TFs from the expression profiles of target genes. A simple model is a two-layer network with unobserved TF variables in the first layer and observed gene expression variables in the second layer. TFs are connected to regulated genes by weighted edges. The weights, known as factor loadings, indicate the strength and direction of regulation. Of particular interest are methods that produce sparse networks, networks with few edges, since it is known that most genes are regulated by only a small number of TFs, and most TFs regulate only a small number of genes.
  
  
  RESULTS
  In this paper, we explore the performance of five factor analysis algorithms, Bayesian as well as classical, on problems with biological context using both simulated and real data. Factor analysis (FA) models are used in order to describe a larger number of observed variables by a smaller number of unobserved variables, the factors, whereby all correlation between observed variables is explained by common factors. Bayesian FA methods allow one to infer sparse networks by enforcing sparsity through priors. In contrast, in the classical FA, matrix rotation methods are used to enforce sparsity and thus to increase the interpretability of the inferred factor loadings matrix. However, we also show that Bayesian FA models that do not impose sparsity through the priors can still be used for the reconstruction of a gene regulatory network if applied in conjunction with matrix rotation methods. Finally, we show the added advantage of merging the information derived from all algorithms in order to obtain a combined result.
  
  
  CONCLUSIONS
  Most of the algorithms tested are successful in reconstructing the connectivity structure as well as the TF profiles. Moreover, we demonstrate that if the underlying network is sparse it is still possible to reconstruct hidden activity profiles of TFs to some degree without prior connectivity information.
authors.affiliation: School of Crystallography, Birkbeck College, University of London, London, UK. i.pournara@cryst.bbk.ac.uk
authors.forename: Iosifina
authors.initials: I
authors.lastname: Pournara
authors.forename: Lorenz
authors.initials: L
authors.lastname: Wernisch
mesh_terms: D000465:Algorithms; D001499:Bayes Theorem; D003198:Computer Simulation; D005163:Factor Analysis, Statistical; D020869:Gene Expression Profiling / Q000379:methods; D005786:Gene Expression Regulation / Q000502:physiology*; D008957:Models, Genetic; D020411:Oligonucleotide Array Sequence Analysis / Q000379:methods*; D015398:Signal Transduction / Q000502:physiology*; D014157:Transcription Factors / Q000378:metabolism*; D015533:Transcriptional Activation / Q000502:physiology*
chemical_list: D014157:Transcription Factors