By Topic

On the constraint of gene regulatory networks to canalizing functions and post classes

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
$33 $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

5 Author(s)
Ranadip Pal ; Texas Tech University, Electrical and Computer Engineering, Lubbock, 79409, USA ; Harri Lahdesmaki ; Ilya Shmulevich ; Olli Yli-Harja
more authors

An important preliminary goal in learning biological network models from experimental data is to study the plausibility of different types of regulatory mechanisms in living organisms. In addition to providing important biological insight, the knowledge of abundance of some specific regulatory rules in nature helps the computational problems by restricting the space of possible models to be learned. In this paper, we assess the plausibility of canalizing functions and certain post (closed) function classes by examining the feasibility of generating networks containing one class at a time that satisfies some predefined network constraints. The results suggest that these two families of regulatory rules are plausible in the light of currently available experimental data.

Published in:

2008 IEEE International Workshop on Genomic Signal Processing and Statistics

Date of Conference:

8-10 June 2008