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

Bioinformatics

dc.creatorAcuña, V.
dc.creatorVieira-Milreu, P.
dc.creatorCottret, L.
dc.creatorMarchetti-Spaccamela, A.
dc.creatorStougie, L.
dc.creatorSagot, M. F.
dc.date2020-03-11T20:37:52Z
dc.date2022-07-08T20:11:52Z
dc.date2020-03-11T20:37:52Z
dc.date2022-07-08T20:11:52Z
dc.date2012
dc.date.accessioned2023-08-22T08:36:48Z
dc.date.available2023-08-22T08:36:48Z
dc.identifier15090007
dc.identifier15090007
dc.identifierhttps://hdl.handle.net/10533/241434
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/8334309
dc.descriptionMOTIVATION: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.descriptionFONDAP
dc.descriptionFONDAP
dc.languageeng
dc.relationhttps://doi.org/10.1093/bioinformatics/bts423
dc.rightsAtribución-NoComercial-SinDerivadas 3.0 Chile
dc.rightshttp://creativecommons.org/licenses/by-nc-nd/3.0/cl/
dc.rightsinfo:eu-repo/semantics/openAccess
dc.titleAlgorithms and complexity of enumerating minimal precursor sets in genome-wide metabolic networks
dc.titleBioinformatics
dc.typeArticulo
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion


Este ítem pertenece a la siguiente institución