By Topic

Reduction cost for Boolean Networks with perturbation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Dougherty, J. ; Dept. of Signal Process., Tampere Univ. of Technol., Tampere ; Ivanov, I.

A serious obstacle in applying computational models of genomic regulation is their complexity. Thus, there is a need for size reducing mappings that preserve biologically meaningful properties of the models. There are several available reduction mappings for the PBN model that are capable of preserving important structural or dynamical properties of the network. However, the cost of applying such mappings has been largely ignored. This paper studies how the notion of stochastic complexity can be used to measure the cost of reduction in the case of a specific class of constrained reduction mappings.

Published in:

Genomic Signal Processing and Statistics, 2008. GENSiPS 2008. IEEE International Workshop on

Date of Conference:

8-10 June 2008