Reconstruct the Logical Network from the Transition Matrix

TL;DR

This paper introduces a novel method to reconstruct logical networks from transition matrices of Boolean networks, enabling better understanding of their logical structure, especially for arbitrary topologies.

Contribution

The paper presents a new approach using canonical form and Karnaugh maps to convert transition matrices back into logical expressions for Boolean networks.

Findings

Method successfully reconstructs logical networks from transition matrices.

Applicable to Boolean networks with arbitrary topology.

Enhances interpretability of algebraic representations.

Abstract

Reconstructing the logical network from the transition matrix is benefit for learning the logical meaning of the algebraic result from the algebraic representation of a BN. And so far there has no method to convert the matrix expression back to the logic expression for a BN with an arbitrary topology structure. Based on the canonical form and Karnaugh map, we propose a method for reconstructing the logical network from the transition matrix of a Boolean network in this paper.