An Algorithm for Finding the Singleton Attractors and Pre-Images in Strong-Inhibition Boolean Networks
Plos One
|November 19, 2016
Summary
This study introduces an efficient algorithm for identifying singleton attractors and pre-images in strong-inhibition Boolean networks. The method proves advantageous for complex genetic regulatory networks with fewer inhibitory interactions.
Area of Science:
- Systems Biology
- Computational Biology
- Bioinformatics
Background:
- Genetic regulatory networks (GRNs) are crucial for understanding cellular functions.
- Singleton attractors are key dynamic properties of GRNs.
- Strong-inhibition Boolean networks offer a biophysically plausible model for GRNs.
Purpose of the Study:
- To develop and present an algorithm for computing singleton attractors and their pre-images.
- To analyze the computational efficiency of the proposed algorithm.
- To demonstrate the algorithm's utility in studying strong-inhibition Boolean networks.
Main Methods:
- Algorithm design for singleton attractor and pre-image computation.
- Application to strong-inhibition Boolean networks.
- Extensive computational experiments to evaluate performance.
Main Results:
- The algorithm accurately identifies singleton attractors and their pre-images.
- Computational time is proportional to the number of singleton attractors.
- The algorithm shows significant advantages for networks with high average degree and low inhibition.
Conclusions:
- The developed algorithm is effective for analyzing singleton attractors in strong-inhibition Boolean networks.
- This method provides insights into the structure and function of these complex biological networks.
- The algorithm's efficiency makes it suitable for large-scale GRN analysis.
Related Concept Videos
01:25Deactivation Processes: Jablonski Diagram
2.0K
Luminescence, the emission of light by a substance that has absorbed energy, is a process that involves the interaction of molecules with light. The energy-level diagram, or Jablonski diagram, is a graphical representation of these interactions, illustrating the various states and transitions a molecule can undergo. In a typical Jablonski diagram, the lowest horizontal line represents the ground-state energy of the molecule, which is usually a singlet state. This state represents the energies...
2.0K
01:13Stability of Equilibrium Configuration: Problem Solving
1.1K
The stability of equilibrium configurations is an important concept in physics, engineering, and other related fields. In simple terms, it refers to the tendency of an object or system to return to its equilibrium position after being disturbed. The stability of an equilibrium configuration can be analyzed by considering the potential energy function of the system and examining its behavior near the equilibrium point.
Problem-solving in the context of the stability of equilibrium configuration...
Problem-solving in the context of the stability of equilibrium configuration...
1.1K
02:26Protein Networks
4.6K
An organism can have thousands of different proteins, and these proteins must cooperate to ensure the health of an organism. Proteins bind to other proteins and form complexes to carry out their functions. Many proteins interact with multiple other proteins creating a complex network of protein interactions.
These interactions can be represented through maps depicting protein-protein interaction networks, represented as nodes and edges. Nodes are circles that are representative of a protein,...
These interactions can be represented through maps depicting protein-protein interaction networks, represented as nodes and edges. Nodes are circles that are representative of a protein,...
4.6K