z-logo
open-access-imgOpen Access
Some Remarks Concerning the Algorithmic Analysis of Gene Regulatory Networks
Author(s) -
J. Andrés Montoya,
Carolina Mejía
Publication year - 2013
Publication title -
electronic notes in theoretical computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.242
H-Index - 60
ISSN - 1571-0661
DOI - 10.1016/j.entcs.2013.02.006
Subject(s) - monomial , gene regulatory network , focus (optics) , boolean network , theoretical computer science , mathematics , computer science , fixed point , discrete mathematics , gene , combinatorics , boolean function , biology , genetics , gene expression , mathematical analysis , physics , optics
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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom