EUVIMEDEUVIMED entdecken
Open Access

Bayesian Lookahead Perturbation Policy for Inference of Regulatory Networks

Mohammad Alali, Mahdi Imani

IEEE/ACM Transactions on Computational Biology and Bioinformatics · 2024

DOI: 10.1109/tcbb.2024.3402220 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2024. Verfasst von Mohammad Alali und 1 weiteren Autor:innen. Hauptthemen laut MEDLINE: Bayes Theorem, Gene Regulatory Networks. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 37 Literaturangaben. Der Volltext ist frei in PubMed Central verfügbar. Gefördert von: NIBIB NIH HHS, National Institute of Health, National Science Foundation.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The complexity, scale, and uncertainty in regulatory networks (e.g., gene regulatory networks and microbial networks) regularly pose a huge uncertainty in their models. These uncertainties often cannot be entirely reduced using limited and costly data acquired from the normal condition of systems. Meanwhile, regulatory networks often suffer from the non-identifiability issue, which refers to scenarios where the true underlying network model cannot be clearly distinguished from other possible models. Perturbation or excitation is a well-known process in systems biology for acquiring targeted data to reveal the complex underlying mechanisms of regulatory networks and overcome the non-identifiability issue. We consider a general class of Boolean network models for capturing the activation and inactivation of components and their complex interactions. Assuming partial available knowledge about the interactions between components of the networks, this paper formulates the inference process through the maximum aposteriori (MAP) criterion. We develop a Bayesian lookahead policy that systematically perturbs regulatory networks to maximize the performance of MAP inference under the perturbed data. This is achieved by optimally formulating the perturbation process in a reinforcement learning context and deriving a scalable deep reinforcement learning perturbation policy to compute near-optimal Bayesian policy. The proposed method learns the perturbation policy through planning without the need for any real data. The high performance of the proposed approach is demonstrated by comprehensive numerical experiments using the well-known mammalian cell cycle and gut microbial community networks.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

Bayes TheoremGene Regulatory NetworksAlgorithmsComputational BiologySystems BiologyHumans

Förderung

  • NIBIB NIH HHS
  • National Institute of Health
  • National Science Foundation
  • ARMY Research Office

Zitieren

APA

Alali, M., & Imani, M. (2024). Bayesian Lookahead Perturbation Policy for Inference of Regulatory Networks. IEEE/ACM Transactions on Computational Biology and Bioinformatics. https://doi.org/10.1109/tcbb.2024.3402220

Vancouver

Alali M, Imani M. Bayesian Lookahead Perturbation Policy for Inference of Regulatory Networks. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 2024. doi:10.1109/tcbb.2024.3402220

BibTeX
@article{Alali2024,
  author = {Alali, Mohammad and Imani, Mahdi},
  title = {Bayesian Lookahead Perturbation Policy for Inference of Regulatory Networks},
  journal = {IEEE/ACM Transactions on Computational Biology and Bioinformatics},
  year = {2024},
  doi = {10.1109/tcbb.2024.3402220}
}
Kostenlos starten →