title: Algebraic model checking for Boolean gene regulatory networks.
abstract: We present a computational method in which modular and Groebner bases (GB) computation in Boolean rings are used for solving problems in Boolean gene regulatory networks (BN). In contrast to other known algebraic approaches, the degree of intermediate polynomials during the calculation of Groebner bases using our method will never grow resulting in a significant improvement in running time and memory space consumption. We also show how calculation in temporal logic for model checking can be done by means of our direct and efficient Groebner basis computation in Boolean rings. We present our experimental results in finding attractors and control strategies of Boolean networks to illustrate our theoretical arguments. The results are promising. Our algebraic approach is more efficient than the state-of-the-art model checker NuSMV on BNs. More importantly, our approach finds all solutions for the BN problems.
authors: Department of Computer Science, Lamar University, Beaumont, TX 77710, USA. qntran@lamar.edu
authors: Quoc-Nam
authors: QN
authors: Tran
mesh_terms: D000465:Algorithms; D019295:Computational Biology; D053263:Gene Regulatory Networks; D016014:Linear Models; D016015:Logistic Models; D055641:Mathematical Concepts; D008957:Models, Genetic; D015233:Models, Statistical