Skip to main content
Figure 7 | BMC Bioinformatics

Figure 7

From: Detection of attractors of large Boolean networks via exhaustive enumeration of appropriate subspaces of the state space

Figure 7

The number of accessible discontent nodes decreases as the number of nodes grows. Computation time for analyses of networks of networks of different size, depending on the maximum allowed number of discontent nodes. For larger networks, there is a gradual reduction of the maximum number of discontent nodes the software can handle. This is also mirrored in an increased use of memory (not shown). For example, for 40-node networks cycles with up to 4 discontent nodes were accessible. Such cycles contain tens or hundreds of states.

Back to article page