Faisal, SaadiaSaadiaFaisalLichtenberg, GerwaldGerwaldLichtenbergWerner, HerbertHerbertWerner2023-02-242023-02-242006IEEE International Conference on Engineering of Intelligent Systems, ICEIS 2006 : 22 - 23 April 2006, [Islamabad, Pakistan]. - Piscataway, NJ, 2006. - 1703187 324 - 329 (2006)http://hdl.handle.net/11420/14889It has been observed that genetic regulatory networks share many characteristics with Boolean networks such as periodicity, self organization etc. Moreover it is also a known fact that in these networks, most genes are governed by Canalizing Boolean functions. However the actual gene expression level measurements are continuous valued. To combine discrete and continuous aspects, Zhegalkin Polynomials can be used as continuous representations of Boolean functions. The requirement for the Boolean function to be canalizing can be extended to continuous functions by demanding monotonicity with respect to at least the canalizing variable. In this paper it is proven that Canalizing Zhegalkin Polynomials observe this monotonicity property. Moreover, for correct handling of normalized data it is shown that the value of a Zhegalkin Polynomial also lies within the unit interval as long as the values of its input variables also do so. © 2006 IEEE.enBoolean networksCanalizing functionsForcing functionsGenetic networksZhegalkin polynomialsMathematikTechnikIngenieurwissenschaftenCanalizing Zhegalkin polynomials as models for gene expression time series dataConference Paper10.1109/ICEIS.2006.1703187Other