Demo Data from EDBT 2026 / reviewers in the wild / expert
Benjamin Castellaz
dblp:330/4274
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
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
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › systems biology
biochemical reaction network |
0.6 | 1 | 2022 | Quasi-Entropy Closure: a fast and reliable approach to close the moment equations of the Chemical Master Equation · Bioinform. 2022 |
Bioinformatics and computational biology
moment closure approximation |
0.6 | 1 | 2022 | Quasi-Entropy Closure: a fast and reliable approach to close the moment equations of the Chemical Master Equation · Bioinform. 2022 |
Methods — techniques the papers use, named apart from their topics
zero-information closure · 0.6quasi-entropy closure · 0.6method of moments · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Quasi-Entropy Closure: a fast and reliable approach to close the moment equations of the Chemical Master EquationabstractMOTIVATION: The Chemical Master Equation is a stochastic approach to describe the evolution of a (bio)chemical reaction system. Its solution is a time-dependent probability distribution on all possible configurations of the system. As this number is typically large, the Master Equation is often practically unsolvable. The Method of Moments reduces the system to the evolution of a few moments, which are described by ordinary differential equations. Those equations are not closed, since lower order moments generally depend on higher order moments. Various closure schemes have been suggested to solve this problem. Two major problems with these approaches are first that they are open loop systems, which can diverge from the true solution, and second, some of them are computationally expensive. RESULTS: Here we introduce Quasi-Entropy Closure, a moment-closure scheme for the Method of Moments. It estimates higher order moments by reconstructing the distribution that minimizes the distance to a uniform distribution subject to lower order moment constraints. Quasi-Entropy Closure can be regarded as an advancement of Zero-Information Closure, which similarly maximizes the information entropy. Results show that both approaches outperform truncation schemes. Quasi-Entropy Closure is computationally much faster than Zero-Information Closure, although both methods consider solutions on the space of configurations and hence do not completely overcome the curse of dimensionality. In addition, our scheme includes a plausibility check for the existence of a distribution satisfying a given set of moments on the feasible set of configurations. All results are evaluated on different benchmark problems. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Vincent Wagner, Benjamin Castellaz, Marco Oesting, Nicole Radde |
Bioinform. | 2 |