Demo Data from EDBT 2026 / reviewers in the wild / expert
Matthias P. Gerstl
dblp:164/6677
· DBLP profile ↗
4ranked-venue papers
3as first author
0since 2021 · last 2019
0000-0001-5331-5776ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 4 · 3 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Interdisciplinary, comprehensive, and emerging computing
3 papers |
Bioinformatics and computational biology · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › systems biology
metabolic network analysis |
0.8 | 3 | 2019 | Flux tope analysis: studying the coordination of reaction directions in metabolic networks · Bioinform. 2019 Exact quantification of cellular robustness in genome-scale metabolic networks · Bioinform. 2016 tEFMA: computing thermodynamically feasible elementary flux modes in metabolic networks · Bioinform. 2015 |
Bioinformatics and computational biology › systems biology › metabolic network analysis
elementary flux modes |
0.6 | 2 | 2019 | Flux tope analysis: studying the coordination of reaction directions in metabolic networks · Bioinform. 2019 tEFMA: computing thermodynamically feasible elementary flux modes in metabolic networks · Bioinform. 2015 |
Bioinformatics and computational biology
systems biology |
0.5 | 2 | 2016 | Exact quantification of cellular robustness in genome-scale metabolic networks · Bioinform. 2016 tEFMA: computing thermodynamically feasible elementary flux modes in metabolic networks · Bioinform. 2015 |
Bioinformatics and computational biology › systems biology › metabolic network analysis
minimal cut sets |
0.2 | 1 | 2016 | Exact quantification of cellular robustness in genome-scale metabolic networks · Bioinform. 2016 |
Methods — techniques the papers use, named apart from their topics
sign vector · 0.4reverse search algorithm · 0.4hyperplane arrangement · 0.4reliability theory · 0.2knockout analysis · 0.2metabolome data · 0.2enumeration algorithm · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Flux tope analysis: studying the coordination of reaction directions in metabolic networksabstractMotivation: Elementary flux mode (EFM) analysis allows an unbiased description of metabolic networks in terms of minimal pathways (involving a minimal set of reactions). To date, the enumeration of EFMs is impracticable in genome-scale metabolic models. In a complementary approach, we introduce the concept of a flux tope (FT), involving a maximal set of reactions (with fixed directions), which allows one to study the coordination of reaction directions in metabolic networks and opens a new way for EFM enumeration. Results: A FT is a (nontrivial) subset of the flux cone specified by fixing the directions of all reversible reactions. In a consistent metabolic network (without unused reactions), every FT contains a 'maximal pathway', carrying flux in all reactions. This decomposition of the flux cone into FTs allows the enumeration of EFMs (of individual FTs) without increasing the problem dimension by reaction splitting. To develop a mathematical framework for FT analysis, we build on the concepts of sign vectors and hyperplane arrangements. Thereby, we observe that FT analysis can be applied also to flux optimization problems involving additional (inhomogeneous) linear constraints. For the enumeration of FTs, we adapt the reverse search algorithm and provide an efficient implementation. We demonstrate that (biomass-optimal) FTs can be enumerated in genome-scale metabolic models of B.cuenoti and E.coli, and we use FTs to enumerate EFMs in models of M.genitalium and B.cuenoti. Availability and implementation: The source code is freely available at https://github.com/mpgerstl/FTA. Supplementary information: Supplementary data are available at Bioinformatics online. Matthias P. Gerstl, Stefan Müller 0009, Georg Regensburger, Jürgen Zanghellini |
Bioinform. | 1 |
| 2017 | From elementary flux modes to elementary flux vectors: Metabolic pathway analysis with arbitrary linear flux constraintsabstractElementary flux modes (EFMs) emerged as a formal concept to describe metabolic pathways and have become an established tool for constraint-based modeling and metabolic network analysis. EFMs are characteristic (support-minimal) vectors of the flux cone that contains all feasible steady-state flux vectors of a given metabolic network. EFMs account for (homogeneous) linear constraints arising from reaction irreversibilities and the assumption of steady state; however, other (inhomogeneous) linear constraints, such as minimal and maximal reaction rates frequently used by other constraint-based techniques (such as flux balance analysis [FBA]), cannot be directly integrated. These additional constraints further restrict the space of feasible flux vectors and turn the flux cone into a general flux polyhedron in which the concept of EFMs is not directly applicable anymore. For this reason, there has been a conceptual gap between EFM-based (pathway) analysis methods and linear optimization (FBA) techniques, as they operate on different geometric objects. One approach to overcome these limitations was proposed ten years ago and is based on the concept of elementary flux vectors (EFVs). Only recently has the community started to recognize the potential of EFVs for metabolic network analysis. In fact, EFVs exactly represent the conceptual development required to generalize the idea of EFMs from flux cones to flux polyhedra. This work aims to present a concise theoretical and practical introduction to EFVs that is accessible to a broad audience. We highlight the close relationship between EFMs and EFVs and demonstrate that almost all applications of EFMs (in flux cones) are possible for EFVs (in flux polyhedra) as well. In fact, certain properties can only be studied with EFVs. Thus, we conclude that EFVs provide a powerful and unifying framework for constraint-based modeling of metabolic networks. Steffen Klamt, Georg Regensburger, Matthias P. Gerstl, Christian Jungreuthmayer, Stefan Schuster, Radhakrishnan Mahadevan, Jürgen Zanghellini, Stefan Müller 0009 |
PLoS Comput. Biol. | 3 |
| 2016 | Exact quantification of cellular robustness in genome-scale metabolic networksabstractMOTIVATION: Robustness, the ability of biological networks to uphold their functionality in spite of perturbations, is a key characteristic of all living systems. Although several theoretical approaches have been developed to formalize robustness, it still eludes an exact quantification. Here, we present a rigorous and quantitative approach for the structural robustness of metabolic networks by measuring their ability to tolerate random reaction (or gene) knockouts. RESULTS: In analogy to reliability theory, based on an explicit consideration of all possible knockout sets, we exactly quantify the probability of failure for a given network function (e.g. growth). This measure can be computed if the network's minimal cut sets (MSCs) are known. We show that even in genome-scale metabolic networks the probability of (network) failure can be reliably estimated from MSCs with lowest cardinalities. We demonstrate the applicability of our theory by analyzing the structural robustness of multiple Enterobacteriaceae and Blattibacteriaceae and show a dramatically low structural robustness for the latter. We find that structural robustness develops from the ability to proliferate in multiple growth environments consistent with experimentally found knowledge. CONCLUSION: The probability of (network) failure provides thus a reliable and easily computable measure of structural robustness and redundancy in (genome-scale) metabolic networks. AVAILABILITY AND IMPLEMENTATION: Source code is available under the GNU General Public License at https://github.com/mpgerstl/networkRobustnessToolbox CONTACT: [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Matthias P. Gerstl, Steffen Klamt, Christian Jungreuthmayer, Jürgen Zanghellini |
Bioinform. | 1 |
| 2015 | tEFMA: computing thermodynamically feasible elementary flux modes in metabolic networksabstractUNLABELLED: : Elementary flux modes (EFMs) are important structural tools for the analysis of metabolic networks. It is known that many topologically feasible EFMs are biologically irrelevant. Therefore, tools are needed to find the relevant ones. We present thermodynamic tEFM analysis (tEFMA) which uses the cellular metabolome to avoid the enumeration of thermodynamically infeasible EFMs. Specifically, given a metabolic network and a not necessarily complete metabolome, tEFMA efficiently returns the full set of thermodynamically feasible EFMs consistent with the metabolome. Compared with standard approaches, tEFMA strongly reduces the memory consumption and the overall runtime. Thus tEFMA provides a new way to analyze unbiasedly hitherto inaccessible large-scale metabolic networks. AVAILABILITY AND IMPLEMENTATION: https://github.com/mpgerstl/tEFMA CONTACT: : [email protected] or [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Matthias P. Gerstl, Christian Jungreuthmayer, Jürgen Zanghellini |
Bioinform. | 1 |