Algorithms and complexity of enumerating minimal precursor sets in genome-wide metabolic networks

dc.date.accessioned2020-03-11T20:37:52Z
dc.date.accessioned2022-10-18T23:07:03Z
dc.date.available2020-03-11T20:37:52Z
dc.date.available2022-10-18T23:07:03Z
dc.date.created2020-03-11T20:37:52Z
dc.date.issued2012
dc.identifierhttp://hdl.handle.net/10533/241434
dc.identifier15090007
dc.identifierWOS:000309687500010
dc.identifierno scielo
dc.identifiereid=2-s2.0-84867283013
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/4472773
dc.description.abstractMOTIVATION:In the context of studying whole metabolic networks and their interaction with the environment, the following question arises: given a set of target metabolites T and a set of possible external source metabolites , which are the minimal subsets
dc.languageeng
dc.relationhttps://doi.org/10.1093/bioinformatics/bts423
dc.relation10.1093/bioinformatics/bts423
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsAtribución-NoComercial-SinDerivadas 3.0 Chile
dc.rightshttp://creativecommons.org/licenses/by-nc-nd/3.0/cl/
dc.titleAlgorithms and complexity of enumerating minimal precursor sets in genome-wide metabolic networks
dc.typeArticulo


Este ítem pertenece a la siguiente institución