Mappings between probabilistic Boolean networks Academic Article

abstract

• Probabilistic Boolean Networks (PBNs) comprise a graphical model based on uncertain rule-based dependencies between nodes and have been proposed as a model for genetic regulatory networks. As with any algebraic structure, the characterization of important mappings between PBNs is critical for both theory and application. This paper treats the construction of mappings to alter PBN structure while at the same time maintaining consistency with the original probability structure. It considers projections onto sub-networks, adjunctions of new nodes, resolution reduction mappings formed by merging nodes, and morphological mappings on the graph structure of the PBN. It places PBNs in the framework of many-sorted algebras and in that context defines homomorphisms between PBNs. 2002 Elsevier Science B.V. All rights reserved.

authors

• Dougherty, Edward

published proceedings

• SIGNAL PROCESSING

author list (cited authors)

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

citation count

• 23

complete list of authors

• Dougherty, ER||Shmulevich, I

publication date

• April 2003

publisher

• Elsevier  Publisher

published in

• Signal Processing  Journal

keywords

• Boolean Network
• Genetic Network
• Graphical Model
• Homomorphism
• Many-sorted Algebra
• Mathematical Morphology
• Projection

Digital Object Identifier (DOI)

• 10.1016/S0165-1684(02)00480-2

start page

• 799

end page

• 809

volume

• 83

issue

• 4

URL

• http%3A%2F%2Fdx.doi.org%2F10.1016%2Fs0165-1684%2802%2900480-2