pith. sign in

arxiv: 2511.18883 · v2 · submitted 2025-11-24 · 🧬 q-bio.MN · math.CO· q-bio.CB

Enumeration of Autocatalytic Subsystems in Large Chemical Reaction Networks

Richard Golnik , Thomas Gatter , Peter F. Stadler , Nicola Vassena This is my paper

Pith reviewed 2026-05-17 05:36 UTC · model grok-4.3

classification 🧬 q-bio.MN math.COq-bio.CB
keywords autocatalytic subsystemschemical reaction networksmetabolic networksenumeration algorithmKönig representationE. coli metabolismirreducible coresstoichiometric matrix
0
0 comments X

The pith

Sufficient conditions on subgraphs in the bipartite König representation allow an efficient algorithm to enumerate autocatalytic subnetworks and their minimal cores in full-size metabolic networks.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper derives sufficient conditions for subgraphs that support irreducible autocatalytic systems when a chemical reaction network is viewed as a bipartite graph in its König representation. These conditions support an algorithm that enumerates autocatalytic subnetworks and, as a special case, the smallest such cores, even in genome-scale models. The method is demonstrated through a full analysis of the core metabolism of E. coli and through enumeration of limited-size irreducible autocatalytic subsystems in the complete metabolic networks of E. coli, human erythrocytes, and Methanosarcina barkeri. A reader would care because autocatalysis underpins the self-maintenance of living systems, and being able to locate these subsystems systematically helps clarify metabolic robustness and possible origins of cellular autonomy.

Core claim

The authors derive sufficient conditions for subgraphs supporting irreducible autocatalytic systems in the bipartite König representation of the CRN. On this basis they develop an efficient algorithm to enumerate autocatalytic subnetworks and autocatalytic cores in full-size metabolic networks. The same approach can be restricted to cores alone. As a showcase they provide a complete analysis of autocatalysis in the core metabolism of E. coli and enumerate irreducible autocatalytic subsystems of limited size in the full metabolic networks of E. coli, human erythrocytes, and Methanosarcina barkeri, accompanied by software for routine analysis of large CRNs.

What carries the argument

Sufficient conditions on subgraphs in the bipartite König representation of a chemical reaction network that identify support for irreducible autocatalytic systems and enable enumeration.

If this is right

  • Autocatalytic subnetworks become enumerable in genome-scale metabolic models without exhaustive search.
  • Minimal autocatalytic cores can be isolated as a special case of the same procedure.
  • The approach extends directly to other organisms including archaea and to human cell models such as erythrocytes.
  • Software is supplied that makes systematic autocatalysis analysis routine for any large CRN.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The enumeration could be used in synthetic biology to test candidate minimal self-sustaining reaction sets before laboratory construction.
  • Comparing autocatalytic cores across species might reveal conserved motifs that predate modern metabolism.
  • The subgraph conditions might be relaxed or tightened to study autocatalysis in non-metabolic reaction networks such as signaling or ecological food webs.

Load-bearing premise

The derived sufficient conditions on subgraphs are assumed to be tight enough to locate all biologically meaningful autocatalytic subsystems while remaining computationally feasible for genome-scale networks.

What would settle it

A concrete counter-example would be an experimentally verified autocatalytic subsystem in E. coli core metabolism that the algorithm fails to report, or a subgraph the algorithm reports that, when simulated with the stoichiometric matrix, does not satisfy the algebraic conditions for autocatalysis.

read the original abstract

Autocatalysis is an important feature of metabolic networks, contributing crucially to the self-maintenance of organisms. Autocatalytic subsystems of chemical reaction networks (CRNs) are characterized in terms of algebraic conditions on submatrices of the stoichiometric matrix. Here, we derive sufficient conditions for subgraphs supporting irreducible autocatalytic systems in the bipartite K\H{o}nig representation of the CRN. On this basis, we develop an efficient algorithm to enumerate autocatalytic subnetworks and, as a special case, autocatalytic cores, i.e., minimal autocatalytic subnetworks, in full-size metabolic networks. The same algorithmic approach can also be used to determine autocatalytic cores only. As a showcase application, we provide a complete analysis of autocatalysis in the core metabolism of E. coli and enumerate irreducible autocatalytic subsystems of limited size in full-fledged metabolic networks of E. coli, human erythrocytes, and Methanosarcina barkeri (Archea). The mathematical and algorithmic results are accompanied by software enabling the routine analysis of autocatalysis in large CRNs.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The manuscript derives sufficient conditions for subgraphs supporting irreducible autocatalytic systems in the bipartite König representation of chemical reaction networks. On this basis it develops an efficient algorithm to enumerate autocatalytic subnetworks and, as a special case, minimal autocatalytic cores in genome-scale metabolic networks. The approach is applied to the E. coli core metabolism and to full-size networks of E. coli, human erythrocytes, and Methanosarcina barkeri, with accompanying software provided.

Significance. If the sufficient conditions hold and the enumeration is both sound and complete, the work supplies a systematic, computationally tractable method for locating autocatalytic subsystems that contribute to metabolic self-maintenance. The grounding in standard stoichiometric-matrix properties, the explicit demonstration that the algorithm terminates on genome-scale instances, and the provision of reproducible software constitute clear strengths.

minor comments (3)
  1. [§2.2] §2.2: the definition of an irreducible autocatalytic system via the König representation should be cross-referenced explicitly to the algebraic submatrix conditions stated in the introduction so that readers can verify equivalence without backtracking.
  2. [Table 1] Table 1 (E. coli core results): the column reporting core sizes would benefit from an additional row or footnote indicating which enumerated cores correspond to previously documented biological examples.
  3. [Algorithm 1] Algorithm 1, line 12: the termination criterion for the enumeration loop is stated only informally; a brief complexity remark or reference to the supporting lemma would improve clarity.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive evaluation of the manuscript, accurate summary of our contributions, and recommendation for minor revision. The significance assessment aligns with our goals of providing a systematic and computationally tractable method grounded in stoichiometric properties, along with reproducible software. No specific major comments were provided in the report.

Circularity Check

0 steps flagged

No significant circularity in derivation chain

full rationale

The paper derives sufficient conditions for subgraphs supporting irreducible autocatalytic systems directly from algebraic properties of submatrices of the stoichiometric matrix and standard graph-theoretic features of the bipartite König representation. These conditions are obtained via mathematical reasoning on CRN structure without fitted parameters, self-referential definitions, or load-bearing self-citations. The enumeration algorithm follows as a direct constructive consequence of the derived conditions, and applications to E. coli core metabolism and other networks function as external validation rather than inputs that force the result. The derivation remains self-contained and independent of the target enumerations.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The work relies on the standard modeling assumption that the stoichiometric matrix faithfully encodes the reactions of interest; no free parameters, new entities, or ad-hoc axioms are introduced in the abstract.

axioms (1)
  • domain assumption The stoichiometric matrix of a chemical reaction network accurately captures the stoichiometry of all reactions under consideration.
    This is the foundational modeling premise used to define autocatalytic subsystems via submatrices.

pith-pipeline@v0.9.0 · 5496 in / 1019 out tokens · 69481 ms · 2026-05-17T05:36:17.415516+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

76 extracted references · 76 canonical work pages

  1. [1]

    International Union of Pure and Applied Chemistry (IUPAC), Research Triangle Park, NC, DOI 10.1351/goldbook

    Gold V, McNaught A, The International Union of Pure and Applied Chem- istry (IUPAC) (eds) (2025) The IUPAC Compendium of Chemical Terminology: The Gold Book, 5th edn. International Union of Pure and Applied Chemistry (IUPAC), Research Triangle Park, NC, DOI 10.1351/goldbook

    work page doi:10.1351/goldbook 2025

  2. [2]

    Selforganization of matter and the evolution of biological macromolecules,

    Eigen M (1971) Selforganization of matter and the evolution of biological macro- molecules. Die Naturwissenschaften 58(10):465–523, DOI 10.1007/BF00623322

    work page doi:10.1007/bf00623322 1971

  3. [3]

    Naturwissenschaften 64(11):541–565, DOI 10.1007/ BF00450633

    Eigen M, Schuster P (1977) A principle of natural self-organization: Part A: Emergence of the hypercycle. Naturwissenschaften 64(11):541–565, DOI 10.1007/ BF00450633

    work page 1977

  4. [4]

    Nature 319(6055):618–618, DOI 10.1038/319618a0

    Gilbert W (1986) Origin of life: The RNA world. Nature 319(6055):618–618, DOI 10.1038/319618a0

    work page doi:10.1038/319618a0 1986

  5. [5]

    Nature 338(6212):217–224, DOI 10.1038/338217a0

    Joyce GF (1989) RNA evolution and the origins of life. Nature 338(6212):217–224, DOI 10.1038/338217a0

    work page doi:10.1038/338217a0 1989

  6. [6]

    Nature 418(6894):214– 221, DOI 10.1038/418214a

    Joyce GF (2002) The antiquity of RNA-based evolution. Nature 418(6894):214– 221, DOI 10.1038/418214a

    work page doi:10.1038/418214a 2002

  7. [7]

    Angewandte Chemie (International Ed in English) 52(49):12,800–12,826, DOI 10.1002/anie

    Bissette AJ, Fletcher SP (2013) Mechanisms of autocatalysis. Angewandte Chemie (International Ed in English) 52(49):12,800–12,826, DOI 10.1002/anie. 201303822 33

    work page doi:10.1002/anie 2013

  8. [8]

    Nature Reviews Chemistry 7(10):673–691, DOI 10

    Howlett MG, Fletcher SP (2023) From autocatalysis to survival of the fittest in self-reproducing lipid systems. Nature Reviews Chemistry 7(10):673–691, DOI 10. 1038/s41570-023-00524-8

    work page 2023

  9. [9]

    Entropy 12(7):1733–1742, DOI 10.3390/e12071733

    Hordijk W, Hein J, Steel M (2010) Autocatalytic Sets and the Origin of Life. Entropy 12(7):1733–1742, DOI 10.3390/e12071733

    work page doi:10.3390/e12071733 2010

  10. [10]

    Justus Liebigs Annalen der Chemie 120(3):295–298, DOI 10.1002/jlac.18611200308

    Butlerow A (1861) Bildung einer zuckerartigen Substanz durch Synthese. Justus Liebigs Annalen der Chemie 120(3):295–298, DOI 10.1002/jlac.18611200308

    work page doi:10.1002/jlac.18611200308

  11. [11]

    PLoS Biology 6(1):e18, DOI 10.1371/journal.pbio.0060018

    Orgel LE (2008) The Implausibility of Metabolic Cycles on the Prebiotic Earth. PLoS Biology 6(1):e18, DOI 10.1371/journal.pbio.0060018

    work page doi:10.1371/journal.pbio.0060018 2008

  12. [12]

    eLife 6:e20,667, DOI 10

    Barenholz U, Davidi D, Reznik E, Bar-On Y, Antonovsky N, Noor E, Milo R (2017) Design principles of autocatalytic cycles constrain enzyme kinetics and force low substrate saturation at flux branch points. eLife 6:e20,667, DOI 10. 7554/eLife.20667

    work page 2017

  13. [13]

    Journal of Systems Chemistry DOI 10.48550/ arXiv.2107.03086, 2107.03086

    Andersen JL, Flamm C, Merkle D, Stadler PF (2021) Defining Autocatalysis in Chemical Reaction Networks. Journal of Systems Chemistry DOI 10.48550/ arXiv.2107.03086, 2107.03086

    work page arXiv 2021

  14. [14]

    Proceedings of the National Academy of Sciences 117(41):25,230–25,236, DOI 10.1073/pnas.2013527117

    Blokhuis A, Lacoste D, Nghe P (2020) Universal motifs and the diversity of autocatalytic systems. Proceedings of the National Academy of Sciences 117(41):25,230–25,236, DOI 10.1073/pnas.2013527117

    work page doi:10.1073/pnas.2013527117 2020

  15. [15]

    Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 480(2285):20230,694, DOI 10.1098/rspa.2023

    Vassena N, Stadler PF (2024) Unstable cores are the source of instability in chemical reaction networks. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 480(2285):20230,694, DOI 10.1098/rspa.2023. 0694

    work page doi:10.1098/rspa.2023 2024

  16. [16]

    Journal of Mathematical Chemistry 62(5):1012–1078, DOI 10.1007/s10910-024-01576-x

    Gagrani P, Blanco V, Smith E, Baum D (2024) Polyhedral geometry and com- binatorics of an autocatalytic ecosystem. Journal of Mathematical Chemistry 62(5):1012–1078, DOI 10.1007/s10910-024-01576-x

    work page doi:10.1007/s10910-024-01576-x 2024

  17. [17]

    In: The Astrobiology Science Conference (AbSciCon) 2022, pp 503–03

    Honegger P, Flamm C, Fontana W (2022) Efficient Identification of Autocatalysis in Chemical and Biological Networks. In: The Astrobiology Science Conference (AbSciCon) 2022, pp 503–03

    work page 2022

  18. [18]

    DOI 10.48550/ARXIV.2511.14431

    Golnik R, Gatter T, Stadler PF, Vassena N (2025) BiRNe: Symbolic bifurcation analysis of reaction networks with Python. DOI 10.48550/ARXIV.2511.14431

    work page doi:10.48550/arxiv.2511.14431 2025

  19. [19]

    Nucleic Acids Research 48(D1):D402–D406, DOI 10

    Norsigian CJ, Pusarla N, McConn JL, Yurkovich JT, Dräger A, Palsson BO, King Z (2020) BiGG Models 2020: Multi-strain genome-scale models and expansion across the phylogenetic tree. Nucleic Acids Research 48(D1):D402–D406, DOI 10. 1093/nar/gkz1054

    work page 2020

  20. [20]

    Nucleic Acids Research 44(D1):D523–D526, DOI 10.1093/nar/gkv1117

    Moretti S, Martin O, Van Du Tran T, Bridge A, Morgat A, Pagni M (2016) MetaNetX/MNXref – reconciliation of metabolites and biochemical reactions to bring together genome-scale metabolic networks. Nucleic Acids Research 44(D1):D523–D526, DOI 10.1093/nar/gkv1117

    work page doi:10.1093/nar/gkv1117 2016

  21. [21]

    Nucleic Acids Research 53(D1):D1606–D1613, DOI 10.1093/nar/gkae991

    Hawkins C, Xue B, Yasmin F, Wyatt G, Zerbe P, Rhee SY (2025) Plant Metabolic Network 16: Expansion of underrepresented plant groups and experi- mentally supported enzyme data. Nucleic Acids Research 53(D1):D1606–D1613, DOI 10.1093/nar/gkae991

    work page doi:10.1093/nar/gkae991 2025

  22. [22]

    Plant Physiology 152(2):579–589, DOI 10.1104/pp.109

    De Oliveira Dal’Molin CG, Quek LE, Palfreyman R W, Brumbley SM, Nielsen LK (2010) AraGEM, a Genome-Scale Reconstruction of the Primary Metabolic 34 Network in Arabidopsis. Plant Physiology 152(2):579–589, DOI 10.1104/pp.109. 148817

    work page doi:10.1104/pp.109 2010

  23. [23]

    Plant Physiology 162(2):1060–1072, DOI 10.1104/pp.113.216762

    Poolman MG, Kundu S, Shaw R, Fell DA (2013) Responses to Light Intensity in a Genome-Scale Model of Rice Metabolism. Plant Physiology 162(2):1060–1072, DOI 10.1104/pp.113.216762

    work page doi:10.1104/pp.113.216762 2013

  24. [24]

    PLoS ONE 6(7):e21,784, DOI 10.1371/journal.pone.0021784

    Saha R, Suthers PF, Maranas CD (2011) Zea mays iRS1563: A Comprehen- sive Genome-Scale Metabolic Reconstruction of Maize Metabolism. PLoS ONE 6(7):e21,784, DOI 10.1371/journal.pone.0021784

    work page doi:10.1371/journal.pone.0021784 2011

  25. [25]

    The Plant Journal 85(2):289–304, DOI 10.1111/tpj.13075

    Yuan H, Cheung CM, Poolman MG, Hilbers PAJ, Van Riel NA W (2016) A genome-scale metabolic network reconstruction of tomato ( Solanum lycoper- sicum L.) and its application to photorespiratory metabolism. The Plant Journal 85(2):289–304, DOI 10.1111/tpj.13075

    work page doi:10.1111/tpj.13075 2016

  26. [26]

    Russian Mathematical Surveys 29(6):89– 156, DOI 10.1070/RM1974v029n06ABEH001303

    Zykov AA (1974) HYPERGRAPHS. Russian Mathematical Surveys 29(6):89– 156, DOI 10.1070/RM1974v029n06ABEH001303

    work page doi:10.1070/rm1974v029n06abeh001303 1974

  27. [27]

    Forhandlinger i Videnskabs-selskabet i Christiania 1:35–45

    Waage P, Guldberg CM (1864) Studier over affiniteten. Forhandlinger i Videnskabs-selskabet i Christiania 1:35–45

    work page

  28. [28]

    SIAM Journal on Applied Mathematics 72(6):1926–1947, DOI 10

    Müller S, Regensburger G (2012) Generalized Mass Action Systems: Complex Balancing Equilibria and Sign Vectors of the Stoichiometric and Kinetic-Order Subspaces. SIAM Journal on Applied Mathematics 72(6):1926–1947, DOI 10. 1137/110847056

    work page 2012

  29. [29]

    Biochemistry 50(39):8264–8269, DOI 10

    Johnson KA, Goody RS (2011) The Original Michaelis Constant: Translation of the 1913 Michaelis–Menten Paper. Biochemistry 50(39):8264–8269, DOI 10. 1021/bi201284u

    work page 2011

  30. [30]

    The Journal of Physiology 40:i–vii, http: //jp.physoc.org/content/40/supplement/i.full.pdf+html

    Hill A V (1910) The possible effects of the aggregation of the molecules of hæmoglobin on its dissociation curves. The Journal of Physiology 40:i–vii, http: //jp.physoc.org/content/40/supplement/i.full.pdf+html

    work page 1910

  31. [31]

    Mathematical Biosciences 210(2):598– 618, DOI 10.1016/j.mbs.2007.07.003

    Angeli D, De Leenheer P, Sontag ED (2007) A Petri net approach to the study of persistence in chemical reaction networks. Mathematical Biosciences 210(2):598– 618, DOI 10.1016/j.mbs.2007.07.003

    work page doi:10.1016/j.mbs.2007.07.003 2007

  32. [32]

    Hsu SB (2013) Ordinary Differential Equations with Applications, 2nd edn. No. 21 in AIMS Series on Applied Mathematic, World Scientific, New Jersey

    work page 2013

  33. [33]

    Archive for Rational Mechanics and Analysis 19(2):81–99, DOI 10.1007/ BF00282276

    Aris R (1965) Prolegomena to the rational analysis of systems of chemical reac- tions. Archive for Rational Mechanics and Analysis 19(2):81–99, DOI 10.1007/ BF00282276

    work page 1965

  34. [34]

    CreateSpace, North Charleston, South Carolina

    Bullo F (2018) Lectures on Network Systems, 1st edn. CreateSpace, North Charleston, South Carolina

    work page 2018

  35. [35]

    Proceedings of the National Academy of Sciences of the United States of America 97(24):13,172– 13,177, DOI 10.1073/pnas.240454797

    Lange BM, Rujan T, Martin W, Croteau R (2000) Isoprenoid biosynthesis: The evolution of two ancient and distinct pathways across genomes. Proceedings of the National Academy of Sciences of the United States of America 97(24):13,172– 13,177, DOI 10.1073/pnas.240454797

    work page doi:10.1073/pnas.240454797 2000

  36. [36]

    Applied Mathematics Letters 7(1):15–18, DOI 10.1016/0893-9659(94)90045-0

    Fukuda K, Matsui T (1994) Finding all the perfect matchings in bipartite graphs. Applied Mathematics Letters 7(1):15–18, DOI 10.1016/0893-9659(94)90045-0

    work page doi:10.1016/0893-9659(94)90045-0 1994

  37. [37]

    Uno T (1997) Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs. In: Goos G, Hartmanis J, Van Leeuwen J, Leong HW, Imai H, Jain S (eds) Algorithms and Computation, vol 1350, Springer Berlin 35 Heidelberg, Berlin, Heidelberg, pp 92–101, DOI 10.1007/3-540-63890-3_11

    work page doi:10.1007/3-540-63890-3_11 1997

  38. [38]

    Fink J (2025) Constant time enumeration of perfect bipartite matchings. DOI 10. 48550/ARXIV.2509.16135

    work page arXiv 2025

  39. [39]

    Journal of Graph Theory 3(3):213– 219, DOI 10.1002/jgt.3190030303

    Grötschel M (1979) On minimal strong blocks. Journal of Graph Theory 3(3):213– 219, DOI 10.1002/jgt.3190030303

    work page doi:10.1002/jgt.3190030303 1979

  40. [40]

    North Holland, Amsterdam

    Berge C (1973) Graphs and Hypergraphs, North-Holland Mathematical Library, vol 6. North Holland, Amsterdam

    work page 1973

  41. [41]

    SIAM Journal on Computing 2(3):211–216, DOI 10.1137/0202017

    Tarjan R (1973) Enumeration of the Elementary Circuits of a Directed Graph. SIAM Journal on Computing 2(3):211–216, DOI 10.1137/0202017

    work page doi:10.1137/0202017 1973

  42. [42]

    SIAM Journal on Computing 4(1):77–84, DOI 10.1137/0204007

    Johnson DB (1975) Finding All the Elementary Circuits of a Directed Graph. SIAM Journal on Computing 4(1):77–84, DOI 10.1137/0204007

    work page doi:10.1137/0204007 1975

  43. [43]

    BIT 16(2):192–204, DOI 10.1007/BF01931370

    Szwarcfiter JL, Lauer PE (1976) A search strategy for the elementary cycles of a directed graph. BIT 16(2):192–204, DOI 10.1007/BF01931370

    work page doi:10.1007/bf01931370 1976

  44. [44]

    Gupta and T

    Gupta A, Suzumura T (2021) Finding All Bounded-Length Simple Cycles in a Directed Graph. DOI 10.48550/arXiv.2105.10094, 2105.10094

    work page doi:10.48550/arxiv.2105.10094 2021

  45. [45]

    Science (New York, NY) 297(5586):1551–1555, DOI 10.1126/science.1073374

    Ravasz E, Somera AL, Mongru DA, Oltvai ZN, Barabási AL (2002) Hierarchi- cal organization of modularity in metabolic networks. Science (New York, NY) 297(5586):1551–1555, DOI 10.1126/science.1073374

    work page doi:10.1126/science.1073374 2002

  46. [46]

    Bioinformatics (Oxford, England) 19(11):1423– 1430, DOI 10.1093/bioinformatics/btg177

    Ma HW, Zeng AP (2003) The connectivity structure, giant strong component and centrality of metabolic networks. Bioinformatics (Oxford, England) 19(11):1423– 1430, DOI 10.1093/bioinformatics/btg177

    work page doi:10.1093/bioinformatics/btg177 2003

  47. [47]

    Bioinformatics (Oxford, England) 20(12):1870–1876, DOI 10

    Ma HW, Zhao XM, Yuan YJ, Zeng AP (2004) Decomposition of metabolic network into functional modules based on the global connectivity structure of reaction graph. Bioinformatics (Oxford, England) 20(12):1870–1876, DOI 10. 1093/bioinformatics/bth167

    work page 2004

  48. [48]

    BMC Bioinformatics 7(1):386, DOI 10.1186/ 1471-2105-7-386

    Zhao J, Yu H, Luo JH, Cao ZW, Li YX (2006) Hierarchical modularity of nested bow-ties in metabolic networks. BMC Bioinformatics 7(1):386, DOI 10.1186/ 1471-2105-7-386

    work page 2006

  49. [49]

    PLoS Computational Biology 7(11):e1002,262, DOI 10.1371/journal.pcbi.1002262

    Sridharan GV, Hassoun S, Lee K (2011) Identification of Biochemical Network Modules Based on Shortest Retroactive Distances. PLoS Computational Biology 7(11):e1002,262, DOI 10.1371/journal.pcbi.1002262

    work page doi:10.1371/journal.pcbi.1002262 2011

  50. [50]

    Nature Methods 17(3):261–272, DOI 10.1038/ s41592-019-0686-2

    Virtanen P, Gommers R, Oliphant TE, Haberland M, Reddy T, Cournapeau D, Burovski E, Peterson P, Weckesser W, Bright J, Van Der Walt SJ, Brett M, Wilson J, Millman KJ, Mayorov N, Nelson ARJ, Jones E, Kern R, Larson E, Carey CJ, Polat I, Feng Y, Moore EW, VanderPlas J, Laxalde D, Perktold J, Cimrman R, Henriksen I, Quintero EA, Harris CR, Archibald AM, Ribe...

    work page 2020

  51. [51]

    Bioinformatics 19(4):532–538, DOI 10.1093/bioinformatics/btg033

    Holme P, Huss M, Jeong H (2003) Subnetwork hierarchies of biochemical pathways. Bioinformatics 19(4):532–538, DOI 10.1093/bioinformatics/btg033

    work page doi:10.1093/bioinformatics/btg033 2003

  52. [52]

    Computer Science Review 1(1):27–64, DOI 10.1016/j.cosrev.2007.05.001

    Schaeffer SE (2007) Graph clustering. Computer Science Review 1(1):27–64, DOI 10.1016/j.cosrev.2007.05.001

    work page doi:10.1016/j.cosrev.2007.05.001 2007

  53. [53]

    Pro- ceedings of the National Academy of Sciences 103(23):8577–8582, DOI 10.1073/ pnas.0601602103

    Newman MEJ (2006) Modularity and community structure in networks. Pro- ceedings of the National Academy of Sciences 103(23):8577–8582, DOI 10.1073/ pnas.0601602103

    work page 2006

  54. [54]

    WebProtÃľgÃľ: a collaborative Web-based platform for editing biomedical ontologies

    Bornstein BJ, Keating SM, Jouraku A, Hucka M (2008) LibSBML: An API Library for SBML. Bioinformatics 24(6):880–881, DOI 10.1093/bioinformatics/ btn051

    work page doi:10.1093/bioinformatics/ 2008

  55. [55]

    In: Varoquaux G, Vaught T, Millman J (eds) Proceedings of the 7th Python in Science Conference, Pasadena, CA USA, pp 11–15

    Hagberg AA, Schult DA, Swart PJ (2008) Exploring network structure, dynamics, and function using NetworkX. In: Varoquaux G, Vaught T, Millman J (eds) Proceedings of the 7th Python in Science Conference, Pasadena, CA USA, pp 11–15

    work page 2008

  56. [56]

    Nature 585(7825):357–362, DOI 10

    Harris CR, Millman KJ, Van Der Walt SJ, Gommers R, Virtanen P, Cournapeau D, Wieser E, Taylor J, Berg S, Smith NJ, Kern R, Picus M, Hoyer S, Van Kerkwijk MH, Brett M, Haldane A, Del Río JF, Wiebe M, Peterson P, Gérard-Marchant P, Sheppard K, Reddy T, Weckesser W, Abbasi H, Gohlke C, Oliphant TE (2020) Array programming with NumPy. Nature 585(7825):357–362...

    work page 2020

  57. [57]

    Computing in Science & Engineering 13(2):31–39

    Behnel S, Bradshaw R, Citro C, Dalcin L, Seljebotn DS, Smith K (2011) Cython: The best of both worlds. Computing in Science & Engineering 13(2):31–39

    work page 2011

  58. [58]

    EcoSal Plus 4(1):10.1128/ecosalplus.10.2.1, DOI 10.1128/ ecosalplus.10.2.1

    Orth JD, Fleming RMT, Palsson BØ (2010) Reconstruction and Use of Micro- bial Metabolic Networks: The Core Escherichia coli Metabolic Model as an Educational Guide. EcoSal Plus 4(1):10.1128/ecosalplus.10.2.1, DOI 10.1128/ ecosalplus.10.2.1

    work page doi:10.1128/ecosalplus.10.2.1 2010

  59. [59]

    Cell Systems 3(3):238–251.e12, DOI 10.1016/j.cels.2016.08.013

    Monk JM, Koza A, Campodonico MA, Machado D, Seoane JM, Palsson BO, Herrgård MJ, Feist AM (2016) Multi-omics Quantification of Species Variation of Escherichia coli Links Molecular Features with Strain Phenotypes. Cell Systems 3(3):238–251.e12, DOI 10.1016/j.cels.2016.08.013

    work page doi:10.1016/j.cels.2016.08.013 2016

  60. [60]

    BMC systems biology 5:110, DOI 10.1186/1752-0509-5-110

    Bordbar A, Jamshidi N, Palsson BO (2011) iAB-RBC-283: A proteomically derived knowledge-base of erythrocyte metabolism that can be used to simu- late its physiological and patho-physiological states. BMC systems biology 5:110, DOI 10.1186/1752-0509-5-110

    work page doi:10.1186/1752-0509-5-110 2011

  61. [61]

    Molecular Systems Biology 2:2006.0004, DOI 10.1038/msb4100046

    Feist AM, Scholten JCM, Palsson BØ, Brockman FJ, Ideker T (2006) Modeling methanogenesis with a genome-scale metabolic reconstruction of Methanosarcina barkeri. Molecular Systems Biology 2:2006.0004, DOI 10.1038/msb4100046

    work page doi:10.1038/msb4100046 2006

  62. [62]

    DOI 10.48550/arXiv.2109.01130, 2109.01130 37

    Unterberger J, Nghe P (2022) Stoechiometric and dynamical autocatalysis for diluted chemical reaction networks. DOI 10.48550/arXiv.2109.01130, 2109.01130 37

    work page doi:10.48550/arxiv.2109.01130 2022

  63. [63]

    DOI 10.48550/arXiv.2508.15273, 2508.15273

    Blokhuis A, Stadler PF, Vassena N (2025) Stoichiometric recipes for periodic oscillations in reaction networks. DOI 10.48550/arXiv.2508.15273, 2508.15273

    work page doi:10.48550/arxiv.2508.15273 2025

  64. [64]

    Bisdorff R (2010) On detecting and enumerating chordless circuits in a digraph. Tech. rep., Univ. Luxembourg, Luxembourg

    work page 2010

  65. [65]

    Journal of Computer and System Sciences 152:103,637, DOI 10.1016/j.jcss.2025.103637

    Tada T, Haraguchi K (2025) A linear delay algorithm in SD set system and its application to subgraph enumeration. Journal of Computer and System Sciences 152:103,637, DOI 10.1016/j.jcss.2025.103637

    work page doi:10.1016/j.jcss.2025.103637 2025

  66. [66]

    In: Fernau H, Zhu B (eds) Combinatorial Algorithms, vol 15885, Springer Nature Switzerland, Cham, pp 89–102, DOI 10.1007/978-3-031-98740-3_7

    Shota K, Haraguchi K (2025) A Linear Delay Algorithm of Enumerating Strongly- Connected Induced Subgraphs Based on SSD Set System. In: Fernau H, Zhu B (eds) Combinatorial Algorithms, vol 15885, Springer Nature Switzerland, Cham, pp 89–102, DOI 10.1007/978-3-031-98740-3_7

    work page doi:10.1007/978-3-031-98740-3_7 2025

  67. [67]

    Journal of Graph Theory 23(2):175–184, DOI 10.1002/(SICI)1097-0118(199610)23:2<175::AID-JGT8>3

    Galluccio A, Loebl M (1996) (p,q)-odd digraphs. Journal of Graph Theory 23(2):175–184, DOI 10.1002/(SICI)1097-0118(199610)23:2<175::AID-JGT8>3. 0.CO;2-Q

    work page doi:10.1002/(sici)1097-0118(199610)23:2 1996

  68. [68]

    Discrete Mathematics 233(1-3):175–182, DOI 10.1016/S0012-365X(00)00236-3

    Loebl M, Matamala M (2001) Some remarks on cycles in graphs and digraphs. Discrete Mathematics 233(1-3):175–182, DOI 10.1016/S0012-365X(00)00236-3

    work page doi:10.1016/s0012-365x(00)00236-3 2001

  69. [69]

    Discussiones Mathematicae Graph Theory 23(2):241, DOI 10.7151/ dmgt.1200

    Gleiss PM, Leydold J, Stadler PF (2003) Circuit bases of strongly connected digraphs. Discussiones Mathematicae Graph Theory 23(2):241, DOI 10.7151/ dmgt.1200

    work page 2003

  70. [70]

    Discrete Mathematics & Theoretical Computer Science vol

    Havet F, Nisse N (2019) Constrained ear decompositions in graphs and digraphs. Discrete Mathematics & Theoretical Computer Science vol. 21 no. 4(Graph Theory):4544, DOI 10.23638/DMTCS-21-4-3

    work page doi:10.23638/dmtcs-21-4-3 2019

  71. [71]

    Theoretical Computer Science 411(3):691–700, DOI 10.1016/j.tcs.2009.10.024

    Boley M, Horváth T, Poigné A, Wrobel S (2010) Listing closed sets of strongly accessible set systems with applications to data mining. Theoretical Computer Science 411(3):691–700, DOI 10.1016/j.tcs.2009.10.024

    work page doi:10.1016/j.tcs.2009.10.024 2010

  72. [72]

    A minimal autocatalytic subnetwork (MAS) is defined to be the subnet- work with the least number of reactions containing a particular autocatalytic core

    Conte A, Grossi R, Marino A, Versari L (2019) Listing Maximal Subgraphs Sat- isfying Strongly Accessible Properties. SIAM Journal on Discrete Mathematics 33(2):587–613, DOI 10.1137/17M1152206 9 Appendix The ILP approach of [ 16] is based on subnetworks (X ′, R′) of a CRN (X, R) where R′ R and X ′ := X(R′) is defined as the set of species participating in ...

    work page doi:10.1137/17m1152206 2019

  73. [73]

    be a subgraph of K with reactant vertices X ′, reaction vertices R′, and edges E1 X ′ R′ and E′ 2 R′ X ′ such that

    work page

  74. [74]

    Then K′ is child-selective with κ(x) = r for (x, r)2 E′ 1

    every x2 X ′ has out-degree 1 and every x2 R′ has in-degree 1. Then K′ is child-selective with κ(x) = r for (x, r)2 E′ 1. Proof. Since x2 X ′ has out-degree 1 and K′ is bipartite, there is a unique κ(x)2 R′. Analogously, for every r2 R′ there is a unique µ(r)2 X ′ and we have (x, κ(x))2 E′ 1 for all x2 X ′ as well as (µ(r), r)2 E′ 1 for all r2 R′. Thus we...

    work page

  75. [75]

    there is a positive vector v > 0 such that S[κ]v > 0

    work page

  76. [76]

    Property 1 is identical to property (i) of Def

    K(κ) does not possess source and sink vertices; Proof. Property 1 is identical to property (i) of Def. 5. First, suppose κ is autocatalytic. Property (i) of Def. 5 further implies that no sub- strate vertex is a source in K(κ) because the row S[κ]x, corresponding to substrate x, satisfies S[κ]xv > 0 and thus x is product in at least one reaction. By Eq. (...

    work page