Inference of Regulatory Networks Through Temporally Sparse Data
Mohammad Alali, Mahdi Imani

TL;DR
This paper introduces a scalable Bayesian optimization approach using kernel methods to infer gene regulatory network topologies from limited and sparse temporal genomics data, improving efficiency over exhaustive searches.
Contribution
It develops a novel topology inference method for gene regulatory networks that leverages Gaussian Processes with topology-inspired kernels, enabling efficient search in large candidate spaces.
Findings
Effective inference on mammalian cell-cycle network
Outperforms traditional exhaustive search methods
Handles limited and sparse data efficiently
Abstract
A major goal in genomics is to properly capture the complex dynamical behaviors of gene regulatory networks (GRNs). This includes inferring the complex interactions between genes, which can be used for a wide range of genomics analyses, including diagnosis or prognosis of diseases and finding effective treatments for chronic diseases such as cancer. Boolean networks have emerged as a successful class of models for capturing the behavior of GRNs. In most practical settings, inference of GRNs should be achieved through limited and temporally sparse genomics data. A large number of genes in GRNs leads to a large possible topology candidate space, which often cannot be exhaustively searched due to the limitation in computational resources. This paper develops a scalable and efficient topology inference for GRNs using Bayesian optimization and kernel-based methods. Rather than an exhaustive…
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.
Taxonomy
TopicsGene Regulatory Network Analysis · Cell Image Analysis Techniques · Single-cell and spatial transcriptomics
MethodsGaussian Process
