Parameter Identification of Canalyzing and Nested Canalyzing Boolean Functions with Ternary Vectors for Gene Networks

  • Annika Eichler
  • Gerwald LichtenbergEmail author
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 676)


In gene dynamics modeling, parameters of Boolean networks are identified from continuous data under various assumptions expressed by logical constraints. These constraints may restrict the dynamics of the network to the subclass of canalyzing or nested canalyzing functions, which are known to be appropriate for genetic networks. This paper introduces high performance algorithms, which solve the parameter identification problem by so called Zhegalkin identification and exploit the restriction to canalyzing or nested canalyzing functions resulting in reduced calculation time. The constraints are formulated in terms of orthogonal ternary vector lists, which offer an efficient representation for Boolean functions. The canalyzing constraints can be intrinsically incorporated in an existing Branch-and-Cut algorithm, which lead to a natural restriction of the search space and thus of the calculation time. For nested canalyzing constraints this is not possible. Instead, an identification algorithm based on enumeration is proposed. The algorithms are applied to mRNA micro array data from mice under different contaminant conditions and good correspondence to a known apoptotic pathway can be shown.


Parameter identification Networks Gene dynamics Systems biology Boolean functions Ternary logic 



The authors would like to thank Saskia Trump and Sabine Attinger from Helmholtz Center for Environmental Research Leipzig for access to microarray data.


  1. 1.
    Bochmann, D., Steinbach, B.: Logikentwurf mit XBOOLE. Verlag Technik (1991)Google Scholar
  2. 2.
    Breindl, C., Chaves, M., Allgöwer, F.: A linear reformulation of Boolean optimization problems and structure identification of gene regulation networks. In: Proceedings of 52nd IEEE Conference on Decision Control, pp. 733–738 (2013)Google Scholar
  3. 3.
    Eichler, A., Lichtenberg, G.: Parameter identification of canalyzing Boolean functions with ternary vectors for gene networks. In: Proceedings of 6th International Conference on Simulation and Modelling Methodologies, Technologies and Applications (Simultech), vol. 1, pp. 110–118 (2016)Google Scholar
  4. 4.
    Faisal, S.: Discrete-Time Modelling of Gene Networks by Zhegalkin Polynomials. Dr. Hut Verlag, Ingenieurwissenschaften (2008)Google Scholar
  5. 5.
    Faisal, S., Lichtenberg, G., Trump, S., Attinger, S.: Structural properties of continuous representations of Boolean functions for gene network modelling. Automatica 46(12), 2047–2052 (2010)CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Faisal, S., Lichtenberg, G., Werner, H.: A polynomial approach to structural gene dynamics modelling. In: Proceedings of 16th IFAC World Congress, p. 2119 (2005)Google Scholar
  7. 7.
    Faisal, S., Lichtenberg, G., Werner, H.: Canalizing Zhegalkin polynomials as models for gene expression time series data. In: Proceedings of 1st International Congress on Engineering and Intelligence Systems (2006)Google Scholar
  8. 8.
    Jarrah, A.S., Raposa, B., Laubenbacher, R.: Nested canalyzing, unate cascade, and polynomial functions. Physica D Nonlinear Phenom. 233(2), 167–174 (2007)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    Just, W., Shmulevich, I., Konvalina, J.: The number and probability of canalizing functions. Physica D Nonlinear Phenom. 197(3–4), 211–221 (2004)CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Kanehisa, M., Goto, S.: KEGG: Kyoto encyclopedia of genes and genomes. Nucleic Acids Res. 28(1), 27–30 (2000)CrossRefGoogle Scholar
  11. 11.
    Kauffman, S.: The Origins of Order: Self Organization and Selection in Evolution. Oxford University Press, New York (1993)Google Scholar
  12. 12.
    Kauffman, S.A., Petersen, C., Samuelsson, B., Troein, C.: Random Boolean network models and the yeast transcriptional network. PNAS 100(25), 14796–14799 (2003)CrossRefGoogle Scholar
  13. 13.
    Kauffman, S.A., Peterson, C., Samuelsson, B., Troein, C.: Genetic networks with canalyzing Boolean rules are always stable. PNAS 101(49), 17102–17107 (2004)CrossRefGoogle Scholar
  14. 14.
    Kolda, T., Bader, B.: Tensor decompositions and applications. SIAM Rev. 51(3), 455–500 (2009)CrossRefzbMATHMathSciNetGoogle Scholar
  15. 15.
    Lichtenberg, G., Eichler, A.: Multilinear algebraic Boolean modelling with tensor decompositions techniques. In: Proceedings of 18th IFAC World Congress, pp. 5603–5608 (2011)Google Scholar
  16. 16.
    Lichtenberg, G., Faisal, S., Werner, H.: Ein Ansatz zur dynamischen Modellierung der Genexpression mit Shegalkin-Polynomen. Automatisierungstechnik 53, 589–596 (2005)CrossRefGoogle Scholar
  17. 17.
    Lin, P., Khatri, S.: Logic Synthesis for Genetic Diseases. Modeling Disease Behavior Using Boolean Networks. Springer, New York (2013)Google Scholar
  18. 18.
    Michaelson, J.J., Trump, S., Rudzok, S., Gräbsch, C., Madureira, D.J., Dautel, F., Mai, J., Attinger, S., Schirmer, K., von Bergen, M., Lehmann, I., Beyer, A.: Transcriptional signatures of regulatory and toxic responses to benzo-[a]-pyrene exposure. BMC Genom. 12(1), 502 (2011). doi: 10.1186/1471-2164-12-502 CrossRefGoogle Scholar
  19. 19.
    Schober, S., Mir, K., Bossert, M.: Reconstruction of Boolean genetic regulatory networks consisting of canalyzing or low sensitivity functions. In: Proceeding of International ITG Conference on Source Channel Coding (SCC) (2010)Google Scholar
  20. 20.
    Veliz-Cuba, A., Jarrah, A.S., Laubenbacher, R.: Polynomial algebra of discrete models in systems biology. Bioinformatics 26(13), 1637–1643 (2010)CrossRefzbMATHGoogle Scholar
  21. 21.
    Zhegalkin, I.: Arithmetics of symbolic logic. Mat. Sb. 35(3–4), 311–377 (1928)Google Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  1. 1.Automatic Control LaboratoryETH ZurichZurichSwitzerland
  2. 2.Faculty Life SciencesHamburg University of Applied SciencesHamburgGermany

Personalised recommendations