Algorithms for Singleton Attractor Detection in Planar and Nonplanar AND/OR Boolean Networks

Singleton attractor (also called fixed point) detection is known to be NP-hard even for AND/OR BNs (i.e., BNs consisting of AND/OR nodes), where the Boolean network (BN) is a mathematical model of genetic networks and singleton attractors correspond to steady states. In our recent paper, we developed an O(1.787) time algorithm for detecting a singleton… CONTINUE READING