Reduction mappings between Probabilistic Boolean networks Academic 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.

authors

• Dougherty, Edward
• Ivanov, Ivan

published proceedings

• EURASIP JOURNAL ON APPLIED SIGNAL PROCESSING

author list (cited authors)

• Ivanov, I., & Dougherty, E. R.

citation count

• 24

complete list of authors

• Ivanov, I||Dougherty, ER

publication date

• December 2004

publisher

• Springer Nature  Publisher

published in

• EURASIP Journal on Advances in Signal Processing  Journal

keywords

• Boolean Network
• Genetic Network
• Graphical Models
• Projection
• Reduction

Digital Object Identifier (DOI)

• 10.1155/S1110865704309182

start page

• 125

end page

• 131

volume

• 2004

issue

• 1

URL

• http%3A%2F%2Fdx.doi.org%2F10.1155%2Fs1110865704309182