Figure 1From: Steady state analysis of Boolean molecular network models via model reduction and computational algebraFlow chart of steady state computation. Main steps in our method highlighting the intermediate systems. S denotes the set of steady states of a given network; f is an arbitrary Boolean network, g is an AND-NOT network (in possibly more variables), h is a reduced AND-NOT network, p is the polynomial representation of h.Back to article page