Fixed points of Boolean networks, guessing graphs, and coding theory.
- Submitting institution
-
University of Durham
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 99401
- Type
- D - Journal article
- DOI
-
10.1137/140988358
- Title of journal
- SIAM Journal on Discrete Mathematics
- Article number
- -
- First page
- 2312
- Volume
- 29
- Issue
- 4
- ISSN
- 08954801
- Open access status
- Out of scope for open access requirements
- Month of publication
- -
- Year of publication
- 2015
- URL
-
https://doi.org/10.1137/140988358
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
B - Algorithms and Complexity
- Citation count
- 13
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper introduces an approach to the number of fixed points in Boolean networks based on coding theory and network coding. The results given here are highly nontrivial and surpass the previous results known before.
This paper showed that Boolean networks, notably used in the modelling of gene regulatory networks, could be studied using different approaches from information theory.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -