Counting substrate cycles in topologically restricted metabolic networks

DOI10.1007/978-3-319-58741-7_14zbMATH Open1491.92049OpenAlexW2612871164MaRDI QIDQ2011645FDOQ2011645

Authors: Robert D. Barish, Akira Suyama 

Publication date: 4 August 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-58741-7_14

Recommendations

• Organising metabolic networks: cycles in flux distributions
• Metabolic networks, elementary flux modes, and polyhedral cones
• On flux coupling analysis of metabolic subsystems
• Topological analysis of metabolic control
• Exploring local structural organization of metabolic networks using subgraph patterns
• Viable flux distribution in metabolic networks
• Stoichiometric and constraint-based analysis of biochemical reaction networks
• From topology to dynamics in biochemical networks

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Systems biology, networks (92C42)

Cites Work

• Computational Complexity
• The complexity of computing the permanent
• The relative complexity of approximate counting problems
• The Complexity of Enumeration and Reliability Problems
• Title not available (Why is that?)
• The Planar Hamiltonian Circuit Problem is NP-Complete
• Approximately counting paths and cycles in a graph
• On Unapproximable Versions of $NP$-Complete Problems
• The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes.
• Monte-Carlo algorithms for the planar multiterminal network reliability problem
• On generating all maximal independent sets
• The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two

Cited In (1)

• Counting Hamiltonian cycles on quartic 4-vertex-connected planar graphs

Uses Software

• KEGG

This page was built for publication: Counting substrate cycles in topologically restricted metabolic networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011645)