# Computing Weakly Reversible Linearly Conjugate Chemical Reaction Networks with Minimal Deficiency

Source: [Computing Weakly Reversible Linearly Conjugate Chemical Reaction Networks with Minimal Deficiency](<https://www.sota2.com/research/paper/68fa510f1e209131ce9707db>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-28T13:55:32.523Z

Authors: Matthew D. Johnston, David Siegel, G\\'abor Szederk\\'enyi

Published: 2012-03-22T22:17:47.000Z

## Abstract

Mass-action kinetics is frequently used in systems biology to model the behaviour of interacting chemical species. Many important dynamical properties are known to hold for such systems if they are weakly reversible and have a low deficiency. In particular, the Deficiency Zero and Deficiency One Theorems guarantee strong regularity with regards to the number and stability of positive equilibrium states. It is also known that chemical reaction networks with disparate reaction structure can exhibit the same qualitative dynamics. The theory of linear conjugacy encapsulates the cases where this relationship is captured by a linear transformation. In this paper, we propose a mixed-integer linear programming algorithm capable of determining weakly reversible reaction networks with a minimal deficiency which are linearly conjugate to a given reaction network.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1203.5140>)

[PDF](<https://arxiv.org/pdf/1203.5140.pdf>)