pbn-STAC: Deep reinforcement learning-based framework for cellular reprogramming

Cellular reprogramming can be used for both the prevention and cure of complex diseases. However, the efficiency of discovering reprogramming strategies with classical wet-lab experiments is hindered by lengthy time commitments and high costs. In this study, we leverage deep reinforcement learning to develop a novel computational framework that facilitates the identification of reprogramming strategies. To this end, we formulate a control problem in the context of cellular reprogramming for the Boolean and probabilistic Boolean network models of gene regulatory networks under the asynchronous update mode. Furthermore, to facilitate scalability, we introduce the notion of a pseudo-attractor and a procedure for the identification of pseudo-attractor states. Finally, we devise a computational framework for solving the control problem, which we test on a number of biological networks.

Authors

Institutions

Publication Details

Journal
Theoretical Computer Science
Published
2025-06-06
DOI
https://doi.org/10.1016/j.tcs.2025.115382
Citations
2
Primary Topic
Pluripotent Stem Cells Research
Type
article
Field-Weighted Citation Impact
1.61

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

pbn-STAC: Deep reinforcement learning-based framework for cellular reprogramming

Andrzej Mizera, Jakub Zarzycki
2 citations
Theoretical Computer Science
Pluripotent Stem Cells Research
1.61
article

pbn-STAC: Deep reinforcement learning-based framework for cellular reprogramming

Andrzej Mizera, Jakub Zarzycki
article en
2 citations

Abstract

Cellular reprogramming can be used for both the prevention and cure of complex diseases. However, the efficiency of discovering reprogramming strategies with classical wet-lab experiments is hindered by lengthy time commitments and high costs. In this study, we leverage deep reinforcement learning to develop a novel computational framework that facilitates the identification of reprogramming strategies. To this end, we formulate a control problem in the context of cellular reprogramming for the Boolean and probabilistic Boolean network models of gene regulatory networks under the asynchronous update mode. Furthermore, to facilitate scalability, we introduce the notion of a pseudo-attractor and a procedure for the identification of pseudo-attractor states. Finally, we devise a computational framework for solving the control problem, which we test on a number of biological networks.

Theoretical Computer ScienceVol. 1049
Narodowy Instytut Leków (PL), University of Warsaw (PL)
Narodowe Centrum Nauki
Openalex Percentile: Top 17%
Pluripotent Stem Cells Research
1.61
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.