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.
Theoretical Computer Science 411(3):691–700, DOI 10.1016/j.tcs.2009.10.024
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
New enumeration algorithms for minimal removable sets in monotone systems yield O((n+m) log n) time for k-cores and O((n+m) log n)-delay for all k-core subgraphs.
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.