The Annals of Applied Statistics
- Ann. Appl. Stat.
- Volume 4, Number 2 (2010), 663-686.
Sparse regulatory networks
In many organisms the expression levels of each gene are controlled by the activation levels of known “Transcription Factors” (TF). A problem of considerable interest is that of estimating the “Transcription Regulation Networks” (TRN) relating the TFs and genes. While the expression levels of genes can be observed, the activation levels of the corresponding TFs are usually unknown, greatly increasing the difficulty of the problem. Based on previous experimental work, it is often the case that partial information about the TRN is available. For example, certain TFs may be known to regulate a given gene or in other cases a connection may be predicted with a certain probability. In general, the biology of the problem indicates there will be very few connections between TFs and genes. Several methods have been proposed for estimating TRNs. However, they all suffer from problems such as unrealistic assumptions about prior knowledge of the network structure or computational limitations. We propose a new approach that can directly utilize prior information about the network structure in conjunction with observed gene expression data to estimate the TRN. Our approach uses L1 penalties on the network to ensure a sparse structure. This has the advantage of being computationally efficient as well as making many fewer assumptions about the network structure. We use our methodology to construct the TRN for E. coli and show that the estimate is biologically sensible and compares favorably with previous estimates.
Ann. Appl. Stat. Volume 4, Number 2 (2010), 663-686.
First available in Project Euclid: 3 August 2010
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
James, Gareth M.; Sabatti, Chiara; Zhou, Nengfeng; Zhu, Ji. Sparse regulatory networks. Ann. Appl. Stat. 4 (2010), no. 2, 663--686. doi:10.1214/10-AOAS350. https://projecteuclid.org/euclid.aoas/1280842135.