Demo Data from EDBT 2026 / reviewers in the wild / expert
Christian Skjødt Steenmans
dblp:296/9194
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 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.
| Artificial intelligence
1 paper |
Probabilistic and Bayesian machine learning · 50% Generative modeling · 50% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
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 |
|---|---|---|---|---|
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes › markov chain
deep markov models |
0.5 | 1 | 2021 | Efficient Generative Modelling of Protein Structure Fragments using a Deep Markov Model · ICML 2021 |
Machine learning › Generative modeling › flow matching
protein backbone generation |
0.5 | 1 | 2021 | Efficient Generative Modelling of Protein Structure Fragments using a Deep Markov Model · ICML 2021 |
Bioinformatics and computational biology › protein structure prediction
fragment library generation |
0.5 | 1 | 2021 | Efficient Generative Modelling of Protein Structure Fragments using a Deep Markov Model · ICML 2021 |
Bioinformatics and computational biology
protein structure prediction |
0.5 | 1 | 2021 | Efficient Generative Modelling of Protein Structure Fragments using a Deep Markov Model · ICML 2021 |
Methods — techniques the papers use, named apart from their topics
probabilistic programming · 1.0directional statistics · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Efficient Generative Modelling of Protein Structure Fragments using a Deep Markov ModelabstractFragment libraries are often used in protein structure prediction, simulation and design as a means to significantly reduce the vast conformational search space. Current state-of-the-art methods for fragment library generation do not properly account for aleatory and epistemic uncertainty, respectively due to the dynamic nature of proteins and experimental errors in protein structures. Additionally, they typically rely on information that is not generally or readily available, such as homologous sequences, related protein structures and other complementary information. To address these issues, we developed BIFROST, a novel take on the fragment library problem based on a Deep Markov Model architecture combined with directional statistics for angular degrees of freedom, implemented in the deep probabilistic programming language Pyro. BIFROST is a probabilistic, generative model of the protein backbone dihedral angles conditioned solely on the amino acid sequence. BIFROST generates fragment libraries with a quality on par with current state-of-the-art methods at a fraction of the run-time, while requiring considerably less information and allowing efficient evaluation of probabilities. Christian B. Thygesen, Christian Skjødt Steenmans, Ahmad Salim Al-Sibahi, Lys Sanz Moreta, Anders Bundgård Sørensen, Thomas Hamelryck |
ICML | 2 |