{'fraction_non_alphanumeric': 0.01697792869269949, 'fraction_numerical': 0.0, 'mean_word_length': 5.238095238095238, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Method for Computing Attractor Fields in Coupled Boolean Networks

The processes of stability and synchronization in networks of interacting dynamical entities perform very relevant roles in many biological contexts, and specially in gene regulatory networks. Coupled Boolean Networks (CBN) present a wide spectrum of potential applications, mainly in Systems Biology. Despite its importance, there are relatively few studies focused on stability involving a specific class of models. Attractor fields of CBNs consist in a constrained class of globally stable states of the system, in which the dynamics of each interacting entity remains “locally confined” in the same local attractor. The main goal of this paper is to present a computationally efficient method that, given a CBN as input, identify all its attractor fields. Experimental results show that our method is capable of recovering all attractor fields in a feasible time (in the order of minutes or at most a couple of hours in a single desktop), even for CBNs containing several thousands of attractor fields, suggesting that the proposed method is suitable to capture the dynamics structure of large scale CBNs.