CANA
CANA copied to clipboard
CASCI-lab
CANAlization: Control & Redundancy in Boolean Networks
When computing the degree of a weighted graph in Networkx, one needs to specify the weight attribute name. This is missing on lines 536 and 548. Another possible solution (for...
I ran into some trouble installing this in WIndows 11 using python 3.9 a while ago, and I was reminded of these problems when I was upgrading to 3.10 today....
as per the title, i get wrong attractors with any constants in the network. consider two simple networks, L and N, respectively: ``` x *= 1 y *= x z...
hello, i found some bad behaviour. adding constants seem to be breaking `state_transition_graph` function and making attractor calculating functions to run ad infimum. additionally, i noticed that adding constants by...
BooleanNode.canalizing_map() doesn't account for the SmS/ ss in the two symbol schema. This is not a problem if there are only one permutable group in the two symbols, but it...
From Luis M. Rocha: it would be great if activity could be directly calculated by changing the aggregation operator in the existing code---at least comments should say that in the...
Dear @ajgates42, @xuan-w, and @tjparmer, Here are some thoughts that I believe we need to think about moving forward with BN control. BNs can be controlled in several different ways,...
Specifically, the network-level functions need to be tested, and we should look at our testing coverage in more detail to identify where other gaps may exist.
currently, partial LUTs are only usable in BooleanNode, with which we can examine incomplete LUTs and generate a full table either randomly or on criteria of required bias and effective...
added schema search rules, sample automata rules, tests, input symmetry for anni_gen in BooleanNode among others. @fcphysics if you have time, i'll be happy to go through the changes with...