From kernels in directed graphs to fixed points and negative cycles in Boolean networks
- 1 May 2013
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 161 (7-8) , 1106-1117
Abstract
No abstract availableKeywords
Funding Information
- French National Agency for Research (ANR-10-BLANC-0218)
This publication has 14 references indexed in Scilit:
- Negative circuits and sustained oscillations in asynchronous automata networksAdvances in Applied Mathematics, 2010
- Graphic requirements for multistability and attractive cycles in a Boolean dynamical frameworkAdvances in Applied Mathematics, 2008
- From minimal signed circuits to the dynamics of Boolean regulatory networksBioinformatics, 2008
- Necessary conditions for multistationarity in discrete dynamical systemsDiscrete Applied Mathematics, 2007
- A combinatorial analogue of the Jacobian problem in automata networksAdvances in Applied Mathematics, 2005
- On kernels and semikernels of digraphsDiscrete Mathematics, 1984
- On the Relation Between the Logical Structure of Systems and Their Ability to Generate Multiple Steady States or Sustained Oscillations1981
- Boolean formalization of genetic control circuitsJournal of Theoretical Biology, 1973
- Metabolic stability and epigenesis in randomly constructed genetic netsJournal of Theoretical Biology, 1969
- Solutions of Irreflexive RelationsAnnals of Mathematics, 1953