The author proposes a computational approach for joint trajectory and network inference, drawing inspiration from the theory of entropy regularized optimal transport and inference for linear dynamical systems. The key idea is to posit that the most likely system should be the one that minimizes the total action of the observed dynamics.
The approach is demonstrated on both simulated data from linear (Ornstein-Uhlenbeck) and non-linear (synthetic and biological) stochastic systems. The results show that leveraging perturbation information, even for a fraction of genes, greatly improves network inference compared to using only unperturbed dynamics.
The author also applies the method to a real biological time-series dataset with CRISPR perturbations of human induced pluripotent stem cells. The inferred networks agree with prior knowledge, and the author finds that providing perturbation data for a subset of genes is sufficient to significantly improve the network inference performance compared to using only wild-type data.
The author discusses potential future extensions, such as modeling non-autonomous systems and utilizing additional dynamical information like RNA velocity or metabolic labeling. Theoretical results on the identifiability and consistency of the approach are also identified as an important direction for future work.
לשפה אחרת
מתוכן המקור
arxiv.org
תובנות מפתח מזוקקות מ:
by Stephen Y Zh... ב- arxiv.org 09-12-2024
https://arxiv.org/pdf/2409.06879.pdfשאלות מעמיקות