DocumentCode
1991889
Title
On the constraint of gene regulatory networks to canalizing functions and post classes
Author
Pal, Ranadip ; Lahdesmaki, Harri ; Shmulevich, Ilya ; Yli-Harja, Olli ; Dougherty, Edward
Author_Institution
Texas Tech Univ., Lubbock, TX
fYear
2008
fDate
8-10 June 2008
Firstpage
1
Lastpage
2
Abstract
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.
Keywords
Boolean functions; biochemistry; biology computing; cellular biophysics; genetics; Boolean networks; biological network models; canalizing functions; cellular processes; computational problems; gene regulatory networks; living organisms; network constraints; post function classes; Bioinformatics; Biological system modeling; Biology computing; Boolean functions; Computer networks; Genomics; Irrigation; Organisms; Steady-state; Systems biology;
fLanguage
English
Publisher
ieee
Conference_Titel
Genomic Signal Processing and Statistics, 2008. GENSiPS 2008. IEEE International Workshop on
Conference_Location
Phoenix, AZ
Print_ISBN
978-1-4244-2371-2
Electronic_ISBN
978-1-4244-2372-9
Type
conf
DOI
10.1109/GENSIPS.2008.4555672
Filename
4555672
Link To Document