Sparse regulatory networks
Gareth M. James, Chiara Sabatti, Nengfeng Zhou, Ji Zhu

TL;DR
This paper introduces a new computational method for estimating sparse transcription regulation networks by integrating prior biological knowledge with gene expression data, improving efficiency and biological relevance.
Contribution
It proposes an $L_1$ penalty-based approach that effectively incorporates prior information to estimate sparse TRNs, addressing limitations of previous methods.
Findings
Successfully applied to E. coli, producing biologically sensible networks.
Outperforms previous methods in accuracy and computational efficiency.
Produces sparse networks consistent with biological expectations.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
