Skip to main content
EURASIP Journal on Advances in Signal Processing
Download PDF

Reduction Mappings between Probabilistic Boolean Networks

EURASIP Journal on Advances in Signal Processing volume 2004, Article number: 314935 (2004) Cite this article

Abstract

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.

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, Texas A&M University, College Station, TX, 77843, USA

    Ivan Ivanov

  2. Department of Electrical Engineering, Texas A&M University, 3128 TAMU, College Station, TX, 77843-3128, USA

    Edward R. Dougherty

Authors
  1. Ivan Ivanov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Edward R. Dougherty
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ivan Ivanov.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Ivanov, I., Dougherty, E.R. Reduction Mappings between Probabilistic Boolean Networks. EURASIP J. Adv. Signal Process. 2004, 314935 (2004). https://doi.org/10.1155/S1110865704309182

Download citation

  • Received:

  • Revised:

  • Published:

  • DOI: https://doi.org/10.1155/S1110865704309182

Keywords