Metabolic networks are NP-hard to reconstruct
type: Item
instance of: scholarly article
title: Metabolic networks are NP-hard to reconstruct
zbMATH Open document ID: 1400.92214
author: Z. Nikoloski
author: Sergio Grimbs
author: Patrick May
author: Joachim Selbig
published in: Journal of Theoretical Biology
publication date: 2018-10-22T00:00:00Z
Mathematics Subject Classification ID: 92C42
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 92-04
Mathematics Subject Classification ID: 05C90
zbMATH DE Number: 6959977
zbMATH Keywords: reconstruction
zbMATH Keywords: metabolic networks
zbMATH Keywords: completeness
zbMATH Keywords: approximation
describes a project that uses: MetaCyc
describes a project that uses: UniProt
describes a project that uses: KEGG
MaRDI profile type: Publication
full work available at URL: j.jtbi.2008.07.015
OpenAlex ID: W2012450576
Wikidata QID: Q46444503
cites work: Q5675543
cites work: Vertex and edge covers with clustering properties: Complexity and algorithms
cites work: Q3270978
cites work: Reducibility among Combinatorial Problems
cites work: On the completeness of a generalized matching problem
cites work: The P k Partition Problem and Related Problems in Bipartite Graphs
cites work: A 1-matching blossom-type algorithm for edge covering problems
cites work: Optimization, approximation, and complexity classes
cites work: Network-based analysis of metabolic regulation in the human red blood cell
cites work: Q4871750
DOI: 10.1016/J.JTBI.2008.07.015
Recommended article: On the identifiability of metabolic network models
Recommended article: Algorithms to Study Large Metabolic Network Dynamics
Recommended article: On the complexity of reconstructing chemical reaction networks
description: scientific article; zbMATH DE number 6959977