Elementary modes

Last updated September 02, 2023

Elementary modes^[1] may be considered minimal realizable flow patterns through a biochemical network that can sustain a steady state. This means that elementary modes cannot be decomposed further into simpler pathways. All possible flows through a network can be constructed from linear combinations of the elementary modes.

The set of elementary modes for a given network is unique (up to an arbitrary scaling factor). Given the fundamental nature of elementary modes in relation to uniqueness and non-decomposability, the term `pathway' can be defined as an elementary mode. Note that the set of elementary modes will change as the set of expressed enzymes change during transitions from one cell state to another. Mathematically, the set of elementary modes is defined as the set of flux vectors, $\mathbf {v}$ , that satisfy the steady state condition,

$\mathbf {N} \ \mathbf {v} (\mathbf {x} ,\mathbf {p} )=0$

where $\mathbf {N}$ is the stoichiometry matrix, $\mathbf {v}$ is the vector of rates, $\mathbf {x}$ the vector of steady state floating (or internal) species and $\mathbf {p}$ , the vector of system parameters.

An important condition is that the rate of each irreversible reaction must be non-negative, $\mathbf {v} _{irr}\geq 0$ .

A more formal definition is given by:^[2]

An elementary mode, $\mathbf {v} _{i}$ , is defined as a vector of fluxes, $v_{1},v_{2},\ldots$ , such that the three conditions listed in the following criteria are satisfied.

The $\mathbf {v} _{i}$ vector must satisfy: $\mathbf {N} \mathbf {v} _{i}=0$ , that is: the steady state condition.
For all irreversible reactions: $v_{i}\geq 0$ . This means that all flow patterns must use reactions that proceed in their most natural direction. This makes the pathway described by the elementary mode a thermodynamically feasible pathway.
The vector $\mathbf {v} _{i}$ must be elementary. That is, it should not be possible to generate $\mathbf {v} _{i}$ by combining two other vectors that satisfy the first and second requirements using the same set of enzymes that appear as non-zero entries in $\mathbf {v} _{i}$ . In other words, it should not be possible to decompose $\mathbf {v} _{i}$ into two other pathways that can themselves sustain a steady state. This is called elementarity. A more formal test is that the null space of the submatrix of $\mathbf {N}$ that only involves the reactions of $\mathbf {v} _{i}$ is of dimension one and has no zero entries.^[2]

Example

Consider a simple branched pathway with all three steps irreversible. Such a pathway will admit two elementary modes which are indicated in thicked (or red) reaction lines.

A simple branch pathway with all reactions irreversible containing just two elementary modes SimpleBranchElementaryModesIrrevAnnotated png.png — A simple branch pathway with all reactions irreversible containing just two elementary modes

Because both $v_{2}$ and $v_{3}$ are irreversible, and elementary mode lying on both these reactions is not possible since it would mean one reactions going against its thermodynamic direction. Each mode in this system satisfies the three conditions described above. The first condition is steady state, that is for each mode $\mathbf {v} _{i}$ , it has to be true that $\mathbf {N} \mathbf {v} _{i}=0$ .

Algebraically the two modes are given by:

$\mathbf {v} _{1}={\begin{bmatrix}1\\1\\0\end{bmatrix}}\quad \mathbf {v} _{2}={\begin{bmatrix}1\\0\\1\end{bmatrix}}$

By substituting each of these vectors into $\mathbf {N} \mathbf {v} _{i}=0$ , it is easy to show that condition one is satisfied. For condition two we must ensure that all reactions that are irreversible have positive entries in the corresponding elements of the elementary modes. Since all three reactions in the branch are irreversible and all entries in the elementary modes are positive, condition two is satisfied.

Finally, to satisfy condition three, we must ask whether we can decompose the two elementary modes into other paths that can sustain a steady state while using the same non-zero entries in the elementary mode. In this example, it is impossible to decompose the elementary modes any further without disrupting the ability to sustain a steady state. Therefore, with all three conditions satisfied, we can conclude that the two vectors shown above are elementary modes.

All possible flows through a network can be constructed from linear combinations of the elementary modes, that is:

${\begin{aligned}\mathbf {v} &=\sum \lambda _{i}\mathbf {v} _{i}\\{\mbox{where}}&\\\lambda &\geq 0\\\end{aligned}}$

such that the entire space of flows through a network can be described. $\lambda _{i}$ must be greater than or equal to zero to ensure that irreversible steps aren't inadvertently made to go in the reverse direction. For example, the following is a possible steady-state flow in the branched pathway.

$v=2.5{\begin{bmatrix}1\\1\\0\end{bmatrix}}+0.5{\begin{bmatrix}1\\0\\1\end{bmatrix}}={\begin{bmatrix}3.0\\2.5\\0.5\end{bmatrix}}$

If one of the outflow steps in the simple branched pathway is made reversible, an additional elementary mode becomes available, representing the flow between the two outflow branches. An additional mode emerges because, with only the first two modes, it is impossible to represent a flow between the two branches because the scaling factor, $\lambda _{i}$ , cannot be negative (which would be required to reverse the flow).

Definition of a Pathway

The Wikipedia page Metabolic pathway defines a pathway as "a metabolic pathway is a linked series of chemical reactions occurring within a cell". This means that any sequence of reactions can be labeled a metabolic pathway. However, as metabolism was being uncovered, groups of reactions were assigned specific labels, such as glycolysis, Krebs Cycle, or Serine biosynthesis. Often the categorization was based on common chemistry or identification of an input and output. For example, serine biosynthesis starts at 3-phosphoglycerate and ends at serine. This is a somewhat ad hoc means for defining pathways, particularly when pathways are dynamic structures, changing as environmental result in changes in gene expression. For example, the Kreb Cycle is often not cyclic as depicted in textbooks. In E. coli and other bacteria, it is only cyclic during aerobic growth on acetate or fatty acids.^[3] Instead, under anaerobiosis, its enzymes function as two distinct biosynthetic pathways producing succinyl-CoA and α-ketoglutarate.

It has therefore been proposed^[4] to define a pathway as either a single elementary mode or some combination of elementary modes. The added advantage is that the set of elementary modes is unique and non-decomposable to simpler pathways. A single elementary mode can therefore be thought of as an elementary pathway. Note that the set of elementary modes will change as the set of expressed enzymes change during transitions from one cell state to another.

Elementary modes, therefore, provide an unambiguous definition of a pathway.

Comment on Condition Three

Condition three relates to the non-decomposability of an elementary mode and is partly what makes elementary modes interesting. The two other important features as indicated before are pathway uniqueness and thermodynamic plausibility. Decomposition implies that it is possible to represent a mode as a combination of two or more other modes. For example, a mode $\mathbf {e} _{1}$ might be composed from two other modes, $\mathbf {e} _{2}$ and $\mathbf {e} _{3}$ :

$\mathbf {e} _{1}=\lambda _{1}\mathbf {e} _{2}+\lambda _{2}\mathbf {e} _{3}$

If a mode can be decomposed, does it mean that the mode is not an elementary mode? Condition three provides a rule to determine whether a decomposition means that a given mode is an elementary mode or not. If it is only possible to decompose a given mode by introducing enzymes that are not used in the mode, then the mode is elementary. That is, is there more than one way to generate a pathway (i.e., something that can sustain a steady state) with the enzymes currently used in the mode? If so, then the mode is not elementary. To illustrate this subtle condition, consider the pathway shown in below.

A stylized pathway map of glycolysis. GlycolysisEM.pdf — A stylized pathway map of glycolysis.

This pathway represents a stylized rendition of glycolysis. Step three and six are reversible and correspond to triose phosphate isomerase and glycerol 3-phosphate dehydrogenase, respectively.

The network has four elementary flux modes, which are shown in the figure below.

A stylized pathway map of glycolysis. GlycolysisEM4.pdf — A stylized pathway map of glycolysis.

The elementary flux mode vectors are shown below:

${\begin{array}{l}\qquad \ \mathbf {e} _{1}\quad \ \ \mathbf {e} _{2}\quad \mathbf {e} _{3}\quad \mathbf {e} _{4}\\{\begin{bmatrix}&{\phantom {-}}0&{\phantom {-}}1&{\phantom {-}}1&{\phantom {-}}1\\&{\phantom {-}}0&{\phantom {-}}1&{\phantom {-}}1&{\phantom {-}}1\\&{\phantom {-}}1&-1&{\phantom {-}}1&{\phantom {-}}0\\&{\phantom {-}}1&{\phantom {-}}0&{\phantom {-}}2&{\phantom {-}}1\\&{\phantom {-}}1&{\phantom {-}}0&{\phantom {-}}2&{\phantom {-}}1\\&-1&{\phantom {-}}2&{\phantom {-}}0&{\phantom {-}}1\\\end{bmatrix}}\\\end{array}}$

Note that it is possible to have negative entries in the set of elementary modes because they will correspond to the reversible steps. Of interest is the observation that the fourth vector, $e_{4}=[1\ 1\ 0\ 1\ 1\ 1\ ]^{T}$ (where $T$ represents the transpose) can be formed from the sum of the first and second vectors. This suggests that the fourth vector is not an elementary mode.

$\mathbf {e} _{4}{\begin{bmatrix}{\phantom {-}}1{\phantom {-}}\\{\phantom {-}}1{\phantom {-}}\\{\phantom {-}}0{\phantom {-}}\\{\phantom {-}}1{\phantom {-}}\\{\phantom {-}}1{\phantom {-}}\\{\phantom {-}}1{\phantom {-}}\\\end{bmatrix}}=\mathbf {e} _{1}{\begin{bmatrix}{\phantom {-}}0{\phantom {-}}\\{\phantom {-}}0{\phantom {-}}\\{\phantom {-}}1{\phantom {-}}\\{\phantom {-}}1{\phantom {-}}\\{\phantom {-}}1{\phantom {-}}\\-1{\phantom {-}}\\\end{bmatrix}}+\mathbf {e} _{2}{\begin{bmatrix}{\phantom {-}}1{\phantom {-}}\\{\phantom {-}}1{\phantom {-}}\\-1{\phantom {-}}\\{\phantom {-}}0{\phantom {-}}\\{\phantom {-}}0{\phantom {-}}\\{\phantom {-}}2{\phantom {-}}\\\end{bmatrix}}$

However, this decomposition only works because we have introduced a new enzyme, $E_{4}$ (triose phosphate isomerase) which is not used in $\mathbf {e} _{4}$ . It is, in fact impossible to decompose $\mathbf {e} _{4}$ into pathways that can sustain a steady state with only the five steps, $e_{1},e_{2},e_{4},e_{5}\ {\mbox{and}}\ e_{6}$ , used in the elementary mode. We conclude therefore that $\mathbf {e} _{4}$ is an elementary mode.

Related Research Articles

In physics, the Lorentz transformations are a six-parameter family of linear transformations from a coordinate frame in spacetime to another frame that moves at a constant velocity relative to the former. The respective inverse transformation is then parameterized by the negative of this velocity. The transformations are named after the Dutch physicist Hendrik Lorentz.

In Euclidean geometry, an affine transformation or affinity is a geometric transformation that preserves lines and parallelism, but not necessarily Euclidean distances and angles.

Quadratic programming (QP) is the process of solving certain mathematical optimization problems involving quadratic functions. Specifically, one seeks to optimize a multivariate quadratic function subject to linear constraints on the variables. Quadratic programming is a type of nonlinear programming.

In mathematics, a symmetric matrix $with real entries is positive-definite if the real number is positive for every nonzero real column vector where is the transpose of . More generally, a Hermitian matrix is positive-definite if the real number is positive for every nonzero complex column vector where denotes the conjugate transpose of$

<span class="mw-page-title-main">Singular value decomposition</span> Matrix decomposition

In linear algebra, the singular value decomposition (SVD) is a factorization of a real or complex matrix. It generalizes the eigendecomposition of a square normal matrix with an orthonormal eigenbasis to any $matrix. It is related to the polar decomposition.$

In mathematics, particularly in linear algebra, a skew-symmetricmatrix is a square matrix whose transpose equals its negative. That is, it satisfies the condition

In linear algebra, a diagonal matrix is a matrix in which the entries outside the main diagonal are all zero; the term usually refers to square matrices. Elements of the main diagonal can either be zero or nonzero. An example of a 2×2 diagonal matrix is $, while an example of a 3\times3 diagonal matrix is . An identity matrix of any size, or any multiple of it, is a diagonal matrix.$

In linear algebra, a square matrix $is called diagonalizable or non-defective if it is similar to a diagonal matrix, i.e., if there exists an invertible matrix and a diagonal matrix such that, or equivalently . For a finite-dimensional vector space, a linear map is called diagonalizable if there exists an ordered basis of consisting of eigenvectors of . These definitions are equivalent: if has a matrix representation as above, then the column vectors of form a basis consisting of eigenvectors of, and the diagonal entries of are the corresponding eigenvalues of; with respect to this eigenvector basis, is represented by . Diagonalization is the process of finding the above and .$

In linear algebra, a Jordan normal form, also known as a Jordan canonical form (JCF), is an upper triangular matrix of a particular form called a Jordan matrix representing a linear operator on a finite-dimensional vector space with respect to some basis. Such a matrix has each non-zero off-diagonal entry equal to 1, immediately above the main diagonal, and with identical diagonal entries to the left and below them.

In the mathematical discipline of linear algebra, the Schur decomposition or Schur triangulation, named after Issai Schur, is a matrix decomposition. It allows one to write an arbitrary complex square matrix as unitarily equivalent to an upper triangular matrix whose diagonal elements are the eigenvalues of the original matrix.

In numerical analysis, one of the most important problems is designing efficient and stable algorithms for finding the eigenvalues of a matrix. These eigenvalue algorithms may also find eigenvectors.

In linear algebra and functional analysis, a projection is a linear transformation $from a vector space to itself such that . That is, whenever is applied twice to any vector, it gives the same result as if it were applied once. It leaves its image unchanged. This definition of "projection" formalizes and generalizes the idea of graphical projection. One can also consider the effect of a projection on a geometrical object by examining the effect of the projection on points in the object.$

In applied mathematics, in particular the context of nonlinear system analysis, a phase plane is a visual display of certain characteristics of certain kinds of differential equations; a coordinate plane with axes being the values of the two state variables, say (x, y), or (q, p) etc. (any pair of variables). It is a two-dimensional case of the general n-dimensional phase space.

In linear algebra, an eigenvector or characteristic vector of a linear transformation is a nonzero vector that changes at most by a constant factor when that linear transformation is applied to it. The corresponding eigenvalue, often represented by $, is the multiplying factor.$

The principle of detailed balance can be used in kinetic systems which are decomposed into elementary processes. It states that at equilibrium, each elementary process is in equilibrium with its reverse process.

In mathematical optimization, the Karush–Kuhn–Tucker (KKT) conditions, also known as the Kuhn–Tucker conditions, are first derivative tests for a solution in nonlinear programming to be optimal, provided that some regularity conditions are satisfied.

In statistics, Bayesian multivariate linear regression is a Bayesian approach to multivariate linear regression, i.e. linear regression where the predicted outcome is a vector of correlated random variables rather than a single scalar random variable. A more general treatment of this approach can be found in the article MMSE estimator.

In linear algebra, eigendecomposition is the factorization of a matrix into a canonical form, whereby the matrix is represented in terms of its eigenvalues and eigenvectors. Only diagonalizable matrices can be factorized in this way. When the matrix being factorized is a normal or real symmetric matrix, the decomposition is called "spectral decomposition", derived from the spectral theorem.

In physics and continuum mechanics, deformation is the change in the shape or size of an object. It has dimension of length with SI unit of metre (m). It is quantified as the residual displacement of particles in a non-rigid body, from an initial configuration to a final configuration, excluding the body's average translation and rotation. A configuration is a set containing the positions of all particles of the body.

A differential equation is a mathematical equation for an unknown function of one or several variables that relates the values of the function itself and its derivatives of various orders. A matrix differential equation contains more than one function stacked into vector form with a matrix relating the functions to their derivatives.

References

↑ Zanghellini, Jürgen; Ruckerbauer, David E.; Hanscho, Michael; Jungreuthmayer, Christian (September 2013). "Elementary flux modes in a nutshell: Properties, calculation and applications". Biotechnology Journal. 8 (9): 1009–1016. doi: 10.1002/biot.201200269 . PMID 23788432.
1 2 Bedaso, Yosef; Bergmann, Frank T.; Choi, Kiri; Sauro, Herbert M. (3 May 2018). "A Portable Structural Analysis Library for Reaction Networks": 245068. doi:10.1101/245068. S2CID 46925656.{{cite journal}}: Cite journal requires |journal= (help) Text was copied from this source, which is available under a Creative Commons Attribution 4.0 International License.
↑ Escherichia coli and Salmonella : cellular and molecular biology (2nd ed.). Washington, D.C.: ASM Press. 1996. ISBN 1555810845.
↑ Schuster, Stefan; Fell, David A.; Dandekar, Thomas (March 2000). "A general definition of metabolic pathways useful for systematic organization and analysis of complex metabolic networks". Nature Biotechnology. 18 (3): 326–332. doi:10.1038/73786. PMID 10700151. S2CID 7742485.

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[1] Zanghellini, Jürgen; Ruckerbauer, David E.; Hanscho, Michael; Jungreuthmayer, Christian (September 2013). "Elementary flux modes in a nutshell: Properties, calculation and applications". Biotechnology Journal. 8 (9): 1009–1016. doi: 10.1002/biot.201200269 . PMID 23788432.

[Bedaso_et_al-2] 1 2 Bedaso, Yosef; Bergmann, Frank T.; Choi, Kiri; Sauro, Herbert M. (3 May 2018). "A Portable Structural Analysis Library for Reaction Networks": 245068. doi:10.1101/245068. S2CID 46925656.{{cite journal}}: Cite journal requires |journal= (help) Text was copied from this source, which is available under a Creative Commons Attribution 4.0 International License.

[3] Escherichia coli and Salmonella : cellular and molecular biology (2nd ed.). Washington, D.C.: ASM Press. 1996. ISBN 1555810845.

[4] Schuster, Stefan; Fell, David A.; Dandekar, Thomas (March 2000). "A general definition of metabolic pathways useful for systematic organization and analysis of complex metabolic networks". Nature Biotechnology. 18 (3): 326–332. doi:10.1038/73786. PMID 10700151. S2CID 7742485.

[1]

[2]

[3]

[4]