Maximum number of fixed points in regulatory Boolean networks

Julio Aracena1

  • 1Departamento Ingeniería Matemática, Universidad de Concepción, Av. Esteban Iturra s/n, Casilla 160-C, Concepción, Chile. jaracena@ing-mat.udec.cl

Summary

Boolean networks model genetic regulation. This study finds an upper bound for the number of stable states (fixed points) in regulatory Boolean networks, aiding in their design.

Related Concept Videos

Cooperative Binding of Transcription Regulators02:13

Cooperative Binding of Transcription Regulators

Transcriptional regulators bind to specific cis-regulatory sequences in the DNA to regulate gene transcription. These cis-regulatory sequences are very short, usually less than ten nucleotide pairs in length. The short length means that there is a high probability of the exact same sequence randomly occurring throughout the genome.  Since regulators can also bind to groups of similar sequences, this further increases the chances of random binding. Transcriptional regulators form dimers that...
Cooperative Binding of Transcription Regulators02:13

Cooperative Binding of Transcription Regulators

Transcriptional regulators bind to specific cis-regulatory sequences in the DNA to regulate gene transcription. These cis-regulatory sequences are very short, usually less than ten nucleotide pairs in length. The short length means that there is a high probability of the exact same sequence randomly occurring throughout the genome.  Since regulators can also bind to groups of similar sequences, this further increases the chances of random binding. Transcriptional regulators form dimers that...
Pole and System Stability01:24

Pole and System Stability

The transfer function is a fundamental concept representing the ratio of two polynomials. The numerator and denominator encapsulate the system's dynamics. The zeros and poles of this transfer function are critical in determining the system's behavior and stability.
Simple poles are unique roots of the denominator polynomial. Each simple pole corresponds to a distinct solution to the system's characteristic equation, typically resulting in exponential decay terms in the system's response.
Covalently Linked Protein Regulators02:04

Covalently Linked Protein Regulators

Proteins can undergo many types of post-translational modifications, often in response to changes in their environment. These modifications play an important role in the function and stability of these proteins. Covalently linked molecules include functional groups, such as methyl, acetyl, and phosphate groups, and also small proteins, such as ubiquitin. There are around 200 different types of covalent regulators that have been identified.
These groups modify specific amino acids in a protein.
Covalently Linked Protein Regulators02:04

Covalently Linked Protein Regulators

Proteins can undergo many types of post-translational modifications, often in response to changes in their environment. These modifications play an important role in the function and stability of these proteins. Covalently linked molecules include functional groups, such as methyl, acetyl, and phosphate groups, and also small proteins, such as ubiquitin. There are around 200 different types of covalent regulators that have been identified.
These groups modify specific amino acids in a protein.
BIBO stability of continuous and discrete -time systems01:24

BIBO stability of continuous and discrete -time systems

System stability is a fundamental concept in signal processing, often assessed using convolution. For a system to be considered bounded-input bounded-output (BIBO) stable, any bounded input signal must produce a bounded output signal. A bounded input signal is one where the modulus does not exceed a certain constant at any point in time.
To determine the BIBO stability, the convolution integral is utilized when a bounded continuous-time input is applied to a Linear Time-Invariant (LTI) system.