Computing all persistent subspaces of a reaction-diffusion system.

ABSTRACT: An algorithm is presented for computing a reaction-diffusion partial differential equation (PDE) system for all possible subspaces that can hold a persistent solution of the equation. For this, all possible sub-networks of the underlying reaction network that are distributed organizations (DOs) are identified. Recently it has been shown that a persistent subspace must be a DO. The algorithm computes the hierarchy of DOs starting from the largest by a linear programming approach using integer cuts. The underlying constraints use elementary reaction closures as minimal building blocks to guarantee local closedness and global self-maintenance, required for a DO. Additionally, the algorithm delivers for each subspace an affiliated set of organizational reactions and minimal compartmentalizatio

SUBMITTER: Peter S 

PROVIDER: S-EPMC10567720 | biostudies-literature | 2023 Oct

REPOSITORIES: biostudies-literature