Evidence map›Paper›PMID 42625196›Full record

ArticleJournal of cheminformatics2026

Using MR-chordless circuits for efficient enumeration of autocatalytic cores in large chemical reaction networks.

Richard Golnik, Nicola Vassena, Peter F Stadler, Thomas Gatter

Abstract read
In one paragraph

Article in Journal of cheminformatics, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Richard GolnikBioinformatics Group, Department of Computer Science, Leipzig University, Härtelstraße 16-18, 04107, Leipzig, Germany. richard@bioinf.uni-leipzig.de.ORCID http://orcid.org/0000-0002-8582-5006
Nicola VassenaBioinformatics Group, Department of Computer Science, Leipzig University, Härtelstraße 16-18, 04107, Leipzig, Germany.ORCID http://orcid.org/0000-0001-5411-4976
Peter F StadlerBioinformatics Group, Department of Computer Science, Leipzig University, Härtelstraße 16-18, 04107, Leipzig, Germany.ORCID http://orcid.org/0000-0001-5567-3016
Thomas GatterBioinformatics Group, Department of Computer Science, Leipzig University, Härtelstraße 16-18, 04107, Leipzig, Germany.ORCID http://orcid.org/0000-0002-5016-5191

Funding

Bundesministerium für Forschung, Technologie und Raumfahrt, Germany 57616814German Network for Bioinformatics Infrastructure, Germany W-de.NBI-018Novo Nordisk Fonden 0066551Sächsisches Staatsministerium für Wissenschaft und Kunst, Germany SCADS24B
6 · The paper itself

Abstract

Autocatalysis is an important property of chemical reaction networks (CRNs) that is particularly prevalent in metabolic networks. A set of well-defined autocatalytic cores prominently features minimal subsystems that determine the autocatalytic capabilities. Recently, a graph-theoretic characterization has become available that enabled the enumeration of moderate-sized autocatalytic cores in real-life metabolic networks. Such an approach relies on enumerating and properly assembling elementary circuits in the bipartite graph associated to a CRN. Here, we improve on this approach in two ways: (1) We elaborate on algorithms for the enumeration of elementary circuits restricted to so-called MR-chordless circuits. These circuits do not have a chord from a Metabolite to a Reaction vertex, and are the only candidates to find autocatalytic cores. (2) We interleave our new algorithm with tests for autocatalysis to further limit the number of circuits that need to be stored for the construction of autocatalytic cores more complex than elementary MR-chordless circuits. Combined, these innovations achieve a performance gain of several orders of magnitude and make it possible to exhaustively enumerate all autocatalytic cores in real-life metabolic reaction networks comprising several hundred metabolites and reactions. Importantly, we find that reaction networks with irreversible reactions contain complex autocatalytic cores comprising more than a single "cycle with an ear". Such structures exceed the established classification of autocatalytic cores for fully reversible networks into five types.Scientific contributionWe developed a new graph-theoretic algorithm for enumerating autocatalytic cores that can handle large genome-scale metabolic models. Implemented in the Python program autogatito, it is up to four orders of magnitude faster than previous methods. Applications to large metabolic network models that involve both reversible and nonreversible reactions reveal that more complex autocatalytic cores exist than predicted by existing classification schemes for reversible reactions.

Indexed as

AutocatalysisExhaustive enumerationGraph-theoretic algorithmIrreversible reactionsMetabolic networks

Identifiers

PMID42625196
PMCPMC13491814

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.