Some Remarks Concerning the Algorithmic Analysis of Gene Regulatory Networks

J. Andrés Montoya, Carolina Mejía
2013 Electronical Notes in Theoretical Computer Science  
In this work we study an algorithmic problem related to gene regulatory networks. This problem is the counting of fixed points in boolean networks. We focus our attention on monomial networks, and we prove that the counting of fixed points is #P complete even in this restricted case.
doi:10.1016/j.entcs.2013.02.006 fatcat:obzpjqg2qbadhmppugepem754q