In this paper, we characterize the attractors of disjunctive Boolean networks with strongly connected dependency graphs and present a method for computing their basins of attraction. Additionally, we investigate the height of such networks—defined as the maximum number of iterations required to reach a periodic orbit.
No takes yet. Share an insight, caveat, or question.
Leila Sharifan (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: