Reduction mappings between probabilistic Boolean networks

DOI10.1155/S1110865704309182MaRDI QIDQ1773704zbMATH OpenFDO

Authors Niranjan Chakravarthy

Publication date 3 May 2005

Published in EURASIP Journal on Applied Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1155/S1110865704309182

zbMATH Keywords

genetic networksprojectionsreduction

Mathematics Subject Classification ID

Applications of graph theory (05C90) General biology and biomathematics (92B05) Genetics and epigenetics (92D10) Problems related to evolution (92D15) Applications of graph theory to circuits and networks (94C15)

Review text

Summary: 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.

Recommendations

• Mappings between probabilistic Boolean networks
• Bisimulations of probabilistic Boolean networks
• Relationships between probabilistic Boolean networks and dynamic Bayesian networks as models of gene regulatory networks
• Reduction of Boolean network models
• Steady-state probabilities for attractors in probabilistic Boolean networks

Cited in

(8)

• Relationships between probabilistic Boolean networks and dynamic Bayesian networks as models of gene regulatory networks
• Optimal intervention in semi-Markov-based asynchronous probabilistic Boolean networks
• Logical matrix factorization towards topological structure and stability of probabilistic Boolean networks
• SIMPLIFYING BOOLEAN NETWORKS
• Context-Sensitive Probabilistic Boolean Networks: Steady-State Properties, Reduction, and Steady-State Approximation
• Bisimulations of probabilistic Boolean networks
• Stationary and structural control in gene regulatory networks: basic concepts
• Mappings between probabilistic Boolean networks

This page was built for publication: Reduction mappings between probabilistic Boolean networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1773704)