An efficient enumeration algorithm is developed from sufficient conditions on subgraphs in the bipartite König representation to identify autocatalytic subnetworks and minimal cores in full metabolic networks.
Journal of Graph Theory 23(2):175–184, DOI 10.1002/(SICI)1097-0118(199610)23:2<175::AID-JGT8>3
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
q-bio.MN 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Enumeration of Autocatalytic Subsystems in Large Chemical Reaction Networks
An efficient enumeration algorithm is developed from sufficient conditions on subgraphs in the bipartite König representation to identify autocatalytic subnetworks and minimal cores in full metabolic networks.