Zur Kurzanzeige

dc.contributor.authorIsermann, Nicole
dc.contributor.authorWeitzel, Michael
dc.contributor.authorWiechert, Wolfgang
dc.contributor.editorGiegerich, Robert
dc.contributor.editorStoye, Jens
dc.date.accessioned2019-10-11T11:32:41Z
dc.date.available2019-10-11T11:32:41Z
dc.date.issued2004
dc.identifier.isbn3-88579-382-2
dc.identifier.issn1617-5468
dc.identifier.urihttp://dl.gi.de/handle/20.500.12116/28678
dc.description.abstractCarbon Labeling Systems (CLS) are large equation systems that describe the dynamics of labeled carbon atoms in a metabolic network. The rapid solution of these systems is the algorithmic backbone of 13C Metabolic Flux Analysis (MFA) which has become one of the most widely used tools in Metabolic Engineering. A new algorithm is presented for the solution of CLS which is not based on iteration schemes or numerical linear algebra methods but on path tracing of labeled particles. It is shown that the set of all paths from the system input to the internal network nodes directly gives the clue to an explicit solution of CLS. The promising potential of this new solution algorithm are outlined.en
dc.language.isoen
dc.publisherGesellschaft für Informatik e.V.
dc.relation.ispartofGerman Conference on Bioinformatics 2004, GCB 2004
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-53
dc.titleKleene's theorem and the solution of metabolic carbon labeling systemsen
dc.typeText/Conference Paper
dc.pubPlaceBonn
mci.reference.pages75-84
mci.conference.sessiontitleRegular Research Papers
mci.conference.locationBielefeld
mci.conference.dateOctober 4-6, 2004


Dateien zu dieser Ressource

Thumbnail

Zur Kurzanzeige