Tom/Gene-Regulatory-Networks-Seminar
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

small update and restructure before deadline. not yet uploaded!

Browse Source
This commit is contained in:
Tom Zuidberg
2026-04-26 23:03:16 +02:00
parent 6ad1ef7115
commit d6c9824912
3 changed files with 52 additions and 35 deletions
Download Patch File Download Diff File Expand all files Collapse all files

BIN
paper.pdf
View File

Binary file not shown.

33
paper.tex
View File

@@ -69,36 +69,39 @@
\end{abstract}
\section{Introduction}00
\subsection{Notation}
\section{Introduction}
\section{Boolean networks}
Explain Boolean network and what an update scheme is using the synchronous/parallel scheme.
\subsection{Notation}
Define clear notation used throughout the paper
\section{Update Schemes}
Explain different update schemes:
\begin{itemize}
\item Synchronous scheme - all nodes update at the same time
\item Sequential - close to synchronous. the nodes update in a specific order and take into account the updated input node if that node had been updated before/is positioned earlier in the sequence
\item block sequential - mix of synchronous and sequential. predefined blocks update sequentiall, inside a block the update follows the synchronous scheme
\item asynchronous deterministic - one node is updated per tick following a specific sequence
\item asynchronous generalized - same as asynchronous deterministic with the slight change that within the sequence nodes may appear multiple times.
\end{itemize}
Explain different update schemes including characteristics for behavior especially chaotic behavior.
\subsection{Synchronous scheme}
all nodes update at the same time
\subsection{Sequential scheme}
close to synchronous. the nodes update in a specific order and take into account the updated input node if that node had been updated before/is positioned earlier in the sequence
\subsection{Block-sequential scheme}
mix of synchronous and sequential. predefined blocks update sequential, inside a block the update follows the synchronous scheme
\subsection{Asynchronous deterministic}
one node is updated per tick following a specific sequence
\subsection{Asynchronous generalized}
same as asynchronous deterministic with the slight change that within the sequence nodes may appear multiple times.
\section{Relevance for Gene Regulatory Networks}
Tie the update schemes and their different outcomes or behavior to GRN.
\section{Conclusion}
Emphasizing the drawbacks of asynchronous models when applied to GRN e.g. it takes way to long to update a GRN using asynchronous deterministic for it to have an effect; assuming that one update takes a few minutes, when the whole process can take days to complete.\cite{schwab2020concepts}
\section{Conclusion}
References: \cite{schwab2020concepts}\cite{aracena2009robustness}\cite{bornholdt2008boolean}\cite{goles2010block}\cite{helikar2011boolean}

40
references.bib
View File

@@ -19,18 +19,32 @@
publisher={Episciences. org}
}
@article{ARACENA20091,
title = {On the robustness of update schedules in Boolean networks},
journal = {Biosystems},
volume = {97},
@article{helikar2011boolean,
title={Boolean modeling of biochemical networks},
author={Helikar, Tomas and Kochi, Naomi and Konvalina, John and A Rogers, Jim},
journal={The Open Bioinformatics Journal},
volume={5},
number={1},
pages = {1-8},
year = {2009},
issn = {0303-2647},
doi = {https://doi.org/10.1016/j.biosystems.2009.03.006},
url = {https://www.sciencedirect.com/science/article/pii/S0303264709000471},
author = {J. Aracena and E. Goles and A. Moreira and L. Salinas},
keywords = {Boolean network, Update schedule, Robustness, Attractor, Dynamical cycle},
abstract = {Deterministic Boolean networks have been used as models of gene regulation and other biological networks. One key element in these models is the update schedule, which indicates the order in which states are to be updated. We study the robustness of the dynamical behavior of a Boolean network with respect to different update schedules (synchronous, block-sequential, sequential), which can provide modelers with a better understanding of the consequences of changes in this aspect of the model. For a given Boolean network, we define equivalence classes of update schedules with the same dynamical behavior, introducing a labeled graph which helps to understand the dependence of the dynamics with respect to the update, and to identify interactions whose timing may be crucial for the presence of a particular attractor of the system. Several other results on the robustness of update schedules and of dynamical cycles with respect to update schedules are presented. Finally, we prove that our equivalence classes generalize those found in sequential dynamical systems.}
year={2011}
}
@article{schwab2020concepts,
title={Concepts in Boolean network modeling: What do they all mean?},
author={Schwab, Julian D and K{\"u}hlwein, Silke D and Ikonomi, Nensi and K{\"u}hl, Michael and Kestler, Hans A},
journal={Computational and structural biotechnology journal},
volume={18},
pages={571--582},
year={2020},
publisher={Elsevier}
}
@article{bornholdt2008boolean,
title={Boolean network models of cellular regulation: prospects and limitations},
author={Bornholdt, Stefan},
journal={Journal of the Royal Society interface},
volume={5},
number={suppl\_1},
pages={S85--S94},
year={2008},
publisher={The Royal Society}
}