Open Access

Reduction Mappings between Probabilistic Boolean Networks

EURASIP Journal on Advances in Signal Processing20042004:314935

Received: 11 April 2003

Published: 21 January 2004


Probabilistic Boolean networks (PBNs) comprise a model describing a directed graph with rule-based dependences between its nodes. The rules are selected, based on a given probability distribution which provides a flexibility when dealing with the uncertainty which is typical for genetic regulatory networks. Given the computational complexity of the model, the characterization of mappings reducing the size of a given PBN becomes a critical issue. Mappings between PBNs are important also from a theoretical point of view. They provide means for developing a better understanding about the dynamics of PBNs. This paper considers two kinds of mappings reduction and projection and their effect on the original probability structure of a given PBN.


Boolean network genetic network graphical models projection reduction

Authors’ Affiliations

Department of Electrical Engineering, Texas A&M University
Department of Electrical Engineering, Texas A&M University


© Ivanov and Dougherty 2004