By Topic

Control-compatible state reduction for Boolean networks

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)
Xiaoning Qian ; Dept. of Electr. & Comput. Eng., Texas A&M Univ., College Station, TX, USA ; Dougherty, E.R.

Reduction of gene regulatory networks is a key problem for genomic signal processing, in particular, to overcome the computational limitations to the design of optimal intervention policies for large networks. This paper proposes a greedy procedure to reduce the state space of a Boolean network with perturbation based on the basins of attraction in the network. We study the effects of the reduction on the steady-state mass for attractors and on the intervention performance of a greedy stationary control policy that is also dependent on the basins of attraction.

Published in:

Genomic Signal Processing and Statistics, 2009. GENSIPS 2009. IEEE International Workshop on

Date of Conference:

17-21 May 2009