On the complexity of reconstructing chemical reaction networks

DOI10.1007/s11786-013-0160-yzbMath1320.80005arXiv1309.7198OpenAlexW1965692670WikidataQ56267571 ScholiaQ56267571MaRDI QIDQ2254073

Daniel Merkle, Peter F. Stadler, Philipp Peters, Rolf Fagerberg, Christoph Flamm

Publication date: 4 February 2015

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.7198

zbMATH Keywords

reductionNP-completenesschemical reaction networkhypergraph reconstructiondeclarative solvers

Mathematics Subject Classification ID

Applications of graph theory (05C90) Hypergraphs (05C65) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Chemistry (general) in thermodynamics and heat transfer (80A50)

Related Items

Reachability analysis of low-order discrete state reaction networks obeying conservation laws

Uses Software

• Mathematica
• MiniSat
• SMT-LIB
• z3
• Plingeling
• PrecoSAT
• MetExplore
• Lingeling
• Limboole

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph theory and qualitative analysis of reaction networks
• Graph-theoretic methods for the analysis of chemical and biochemical networks. I. Multistability and oscillations in ordinary differential equation models
• Directed hypergraphs and applications
• Concordant chemical reaction networks and the species-reaction graph
• Theory and Applications of Satisfiability Testing
• Collective dynamics of ‘small-world’ networks
• Multiple Equilibria in Complex Chemical Reaction Networks: II. The Species-Reaction Graph