Reduction mappings between probabilistic Boolean networks
type: Item
instance of: scholarly article
title: Reduction mappings between probabilistic Boolean networks
zbMATH Open document ID: 1062.92001
DOI: 10.1155/S1110865704309182
author: Niranjan Chakravarthy
published in: EURASIP Journal on Applied Signal Processing
publication date: 2005-05-03T00:00:00Z
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.
Mathematics Subject Classification ID: 92B05
Mathematics Subject Classification ID: 92D10
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 94C15
Mathematics Subject Classification ID: 92D15
zbMATH DE Number: 2163812
zbMATH Keywords: genetic networks
zbMATH Keywords: reduction
zbMATH Keywords: projections
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 2163812