getATM: Compute ATM

In mbraccini/diffeRenTES: Computation of TES-Based Cell Differentiation Trees

Compute ATM

Description

getATM returns the ATM (Attractor Transition Matrix) structure. The ATM computes the probability of a transition between the attractors of the Boolean network upon the introduction of noise in the form of a logic negation to each node of each state of each attractor, checking in which attractor the dynamics relaxes. The diagonal of the ATM accounts for attractor robustness, as diagonal values represent the probability of returning to the same attractor after a perturbation.

Usage

getATM(net, synchronous_attractors, MAX_STEPS_TO_FIND_ATTRACTORS = 1000)

Arguments

net	The Boolean network previously loaded with loadNetwork() of BoolNet package
synchronous_attractors	Synchronous attractors of the Boolean network
MAX_STEPS_TO_FIND_ATTRACTORS	Number of steps after that the dynamics after the perturbation gives up

Value

The output will be a named list containing the computed ATM structure, the number of the lost flips (i.e., the number of perturbations that have not reach another attractor within the provided MAX_STEPS_TO_FIND_ATTRACTORS), and lastly the attractors in two formats: the one returned by the BoolNet package (called decimal) and their binary translation (called binary).

Examples

net <- BoolNet::generateRandomNKNetwork(10, 2)
attractors <- BoolNet::getAttractors(net)
getATM(net, attractors)

mbraccini/diffeRenTES documentation built on Feb. 2, 2023, 6:58 a.m.