Metabolic networks are NP-hard to reconstruct

DOI10.1016/j.jtbi.2008.07.015zbMath1400.92214OpenAlexW2012450576WikidataQ46444503 ScholiaQ46444503MaRDI QIDQ1797721

Sergio Grimbs, Joachim Selbig, Zoran Nikoloski, Patrick May

Publication date: 22 October 2018

Published in: Journal of Theoretical Biology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jtbi.2008.07.015

zbMATH Keywords

approximationcompletenessreconstructionmetabolic networks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of graph theory (05C90) Software, source code, etc. for problems pertaining to biology (92-04) Systems biology, networks (92C42)

Related Items (1)

Modelling in systems biology, neurology and pharmacy

Uses Software

• MetaCyc
• KEGG
• UniProt

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Vertex and edge covers with clustering properties: Complexity and algorithms
• Optimization, approximation, and complexity classes
• Network-based analysis of metabolic regulation in the human red blood cell
• A 1-matching blossom-type algorithm for edge covering problems
• Reducibility among Combinatorial Problems
• On the completeness of a generalized matching problem
• The P k Partition Problem and Related Problems in Bipartite Graphs

This page was built for publication: Metabolic networks are NP-hard to reconstruct