November 15, 2001
Journal Article

An Algebraic-Combinatorial Model for the Identification and Mapping of Biochemical Pathways

Abstract

We develop the mathematical machinery for the construction of an algebraic-combinatorial model using Petri nets to construct an oriented matroid representation of biochemical pathways. For demonstration purposes, we use a model metabolic pathway example from the literature to derive a general biochemical reaction network model. The biomolecular networks define a connectivity matrix that identifies a linear representation of a Petri net. The sub-circuits that span a reaction network are subject to flux conservation laws. The conservation laws correspond to algebraic-combinatorial dual invariants, that are called S- (state) and T- (transition) invariants. Each invariant has an associated minimum support. We show that every minimum support of a Petri net invariant defines a unique signed sub-circuit representation. We prove that the family of signed sub-circuits have an implicit order that defines an oriented matroid. The oriented matroid is then used to identify the feasible sub-circuit pathways than span the biochemical network as the positive cycles in a hyper-digraph.

Revised: November 29, 2001 | Published: November 15, 2001

Citation

Oliveira J.S., C.G. Bailey, J.B. Jones-Oliveira, and D.A. Dixon. 2001. An Algebraic-Combinatorial Model for the Identification and Mapping of Biochemical Pathways. Bulletin of Mathematical Biology 63, no. 6:1163-1196. PNNL-SA-34735.