Published in

Springer (part of Springer Nature), Bulletin of Mathematical Biology, 6(75), p. 906-919

DOI: 10.1007/s11538-013-9829-2

Links

Tools

Export citation

Search in Google Scholar

On Circuit Functionality in Boolean Networks

This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

It has been proved, for several classes of continuous and discrete dynamical systems, that the presence of a positive (resp. negative) circuit in the interaction graph of a system is a necessary condition for the presence of multiple stable states (resp. a cyclic attractor). A positive (resp. negative) circuit is said to be functional when it "generates" several stable states (resp. a cyclic attractor). However, there are no definite mathematical frameworks translating the underlying meaning of "generates." Focusing on Boolean networks, we recall and propose some definitions concerning the notion of functionality along with associated mathematical results. ; Journal Article ; Research Support, Non-U.S. Gov't ; info:eu-repo/semantics/published