Asynchronous attractors of Boolean networks decompose into products of attractors of controlled strong modules, enabling polynomial-time enumeration when modules are small and functions are sparse or nested canalizing.
Kauffman.The origins of order: Self organization and selection in evolution
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Strong modules and asynchronous attractors of Boolean networks
Asynchronous attractors of Boolean networks decompose into products of attractors of controlled strong modules, enabling polynomial-time enumeration when modules are small and functions are sparse or nested canalizing.