BNReduction

BNReduction determines steady states of Boolean molecular network models by applying graph-theoretic reduction to wiring diagrams and solving the resulting polynomial equations over a binary finite system to identify all steady states.

Key Features:

• Graph Theoretic Reduction: Applies a graph-theoretic reduction to the network wiring diagram while preserving information relevant to steady states.
• Polynomial Equation Formulation: Formulates steady-state conditions as a system of polynomial equations over a finite two-element (binary) number system and enables use of computer algebra software for exact solutions.
• Non-Heuristic Determination: Employs a deterministic, non-heuristic algorithm that computes all steady states exactly rather than relying on sampling.
• Scalability and Efficiency: Targets sparse Boolean networks with up to 1000 nodes and handles published models of moderate connectivity.

Scientific Applications:

• Modeling Molecular Networks: Analyzes mathematical models of molecular networks when kinetic parameters are sparse or absent.
• Steady State Analysis: Determines and characterizes steady states of biological systems represented as Boolean networks.

Methodology:

Performs a graph-theoretic reduction of the network wiring diagram. Translates the problem of finding all steady states into solving systems of polynomial equations over a binary finite system and uses computer algebra tools to compute exact solutions.