Description Usage Arguments Details Value Examples
Simulation algorithm to compute the dynamic trayectory of the network.
1 2 3 4 5 6 7 8 | dynamic_evolution.f(BN,
time.steps,
Knockouts="",
Over_expr="",
Over_expr_AA="",
KO_times=NULL,
OE_times=NULL,
asynchronous=TRUE)
|
BN |
A list containing the most representative information of the loaded network.
|
time.steps |
A number specifying the iterations for the simulation algorithm. |
Knockouts |
A character vector with the name of the nodes to knockout (fixed to 0) over all the simulations (empty by default). |
Over_expr |
A character vector with the name of the nodes to overexpress (fixed to 1) over all the simulations (empty by default). |
Over_expr_AA |
A character vector with the name of the nodes to overexpress (fixed to 1) after their first activation (empty by default). |
KO_times |
A numeric vector specifying the iterations where the nodes in Knockouts argument will be fixed to 0. If empty the knockout is applied to the nodes for the entire simulation (empty by default). |
OE_times |
A numeric vector specifying the iterations where the nodes in Over_expr argument will be fixed to 1. If empty the overexpression is applied to the nodes for the entire simulation (empty by default). |
asynchronous |
logical; if FALSE the synchronous mode is selected; if TRUE the asynchronous scheme is chosen (by default). |
This function uses the Boolean functions loaded from the txt file or The Cell Collective repository to compute the dynamic evolution of the network over the selected time steps. These Boolean functions consist on a set of rules specifying how the nodes' states change as a function of the current or past values of its regulator nodes. The main operations of Boolean algebra are the conjunction AND (denoted & in the txt file), the disjunction OR (denoted |), and the negation NOT (denoted !). Appart from these basic operators, some convenience functions have been defined:
THR: threshold operator used to check whether a regulator of a Boolean function is activated in the last n iterations that the user selects (n 3 by default).
MOD: modulator operator that makes the same threshold function as the THR operator but only affecting to the nodes that have a modulation interaction in the Boolean functions of the network.
ANY: operator used to check whether a regulator of a Boolean function is activated in any of the last n iterations of the simulation that the user selects (n 3 by default). This operator is also used to modulate the Boolean functions of the network.
A matrix representing how the nodes of the network (rows) evolve over the iterations of the simulation algorithm (columns).
1 2 3 4 5 6 7 8 9 | data("Example_network")
## Not run:
BN<-read.Boolean.functions(Lines=BN$BooleanFunctions)
# Evolution of the network during 99 time steps:
Pattern<-dynamic_evolution.f(BN,time.steps=99)
# Evolution of the network during 49 time steps and a knockout on ICOS molecule:
Pattern_2<-dynamic_evolution.f(BN,time.steps=49,Knockouts="ICOS")
## End(Not run)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.