Format

Send to

Choose Destination
See comment in PubMed Commons below
Bull Math Biol. 2013 Jun;75(6):906-19. doi: 10.1007/s11538-013-9829-2. Epub 2013 Mar 16.

On circuit functionality in Boolean networks.

Author information

1
Lab. I3S UMR CNRS 7271, Université Nice-Sophia Antipolis, 2000 Route des Lucioles, 06903 Sophia Antipolis, France. comet@unice.fr

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.

PMID:
23504387
DOI:
10.1007/s11538-013-9829-2
[Indexed for MEDLINE]
PubMed Commons home

PubMed Commons

0 comments
How to join PubMed Commons

    Supplemental Content

    Full text links

    Icon for Springer
    Loading ...
    Support Center