Wouter Boomsma

Wouter Boomsma

Auto-generated profile, based on publicly available information

Wouter Boomsma

Department of Computer Science, University of Copenhagen, Copenhagen, Denmark

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 July 2007 in Science
Verified
Journal Article
Closed access
PDF file
EWEske Willerslev
Eske Willerslev
ECEnrico Cappellini
Enrico Cappellini
WBWouter Boomsma
Wouter Boomsma
RNRasmus Nielsen
Rasmus Nielsen
MHMartin B. Hebsgaard
Martin B. Hebsgaard
MCMatthew James Collins
Matthew James Collins
It is difficult to obtain fossil data from the 10% of Earth's terrestrial surface that is covered by thick glaciers and ice sheets, and hence, knowledge of the paleoenvironments of these regions has remained limited. We show that DNA and amino acids from buried organisms can be recovered from the basal sections of deep ice cores, enabling reconstructions of past flora and fauna. We show that high-altitude southern Greenland, currently lying below more than 2 kilometers of ice, was inhabited by a diverse array of conifer trees and insects within the past million years. The results provide direct evidence in support of a forested southern Greenland and suggest that many deep ice cores may contain genetic records of paleoenvironments in their basal sections.

20 February 2014 in PLOS Computational Biology
Verified
Journal Article
Open access
PDF file
WBWouter Boomsma
Wouter Boomsma
JFJesper Ferkinghoff-Borg
Jesper Ferkinghoff-Borg
KLKresten Lindorff-Larsen
Kresten Lindorff-Larsen
A key component of computational biology is to compare the results of computer modelling with experimental measurements. Despite substantial progress in the models and algorithms used in many areas of computational biology, such comparisons sometimes reveal that the computations are not in quantitative agreement with experimental data. The principle of maximum entropy is a general procedure for constructing probability distributions in the light of new data, making it a natural tool in cases when an initial model provides results that are at odds with experiments. The number of maximum entropy applications in our field has grown steadily in recent years, in areas as diverse as sequence analysis, structural modelling, and neurobiology. In this Perspectives article, we give a broad introduction to the method, in an attempt to encourage its further adoption. The general procedure is explained in the context of a simple example, after which we proceed with a real-world application in the field of molecular simulations, where the maximum entropy procedure has recently provided new insight. Given the limited accuracy of force fields, macromolecular simulations sometimes produce results that are at not in complete and quantitative accordance with experiments. A common solution to this problem is to explicitly ensure agreement between the two by perturbing the potential energy function towards the experimental data. So far, a general consensus for how such perturbations should be implemented has been lacking. Three very recent papers have explored this problem using the maximum entropy approach, providing both new theoretical and practical insights to the problem. We highlight each of these contributions in turn and conclude with a discussion on remaining challenges.

1 October 2008 in Systematic Biology
Verified
Journal Article
Open access
PDF file
KMKasper Munch
Kasper Munch
WBWouter Boomsma
Wouter Boomsma
JHJohn P. Huelsenbeck
John P. Huelsenbeck
EWEske Willerslev
Eske Willerslev
RNRasmus Nielsen
Rasmus Nielsen
We provide a new automated statistical method for DNA barcoding based on a Bayesian phylogenetic analysis. The method is based on automated database sequence retrieval, alignment, and phylogenetic analysis using a custom-built program for Bayesian phylogenetic analysis. We show on real data that the method outperforms Blast searches as a measure of confidence and can help eliminate 80% of all false assignment based on best Blast hit. However, the most important advance of the method is that it provides statistically meaningful measures of confidence. We apply the method to a re-analysis of previously published ancient DNA data and show that, with high statistical confidence, most of the published sequences are in fact of Neanderthal origin. However, there are several cases of chimeric sequences that are comprised of a combination of both Neanderthal and modern human DNA.

8 April 2022 in Nature Communications
Verified
Journal Article
Open access
PDF file
NDNicki Skafte Detlefsen
Nicki Skafte Detlefsen
SHSøren Hauberg
Søren Hauberg
WBWouter Boomsma
Wouter Boomsma
How we choose to represent our data has a fundamental impact on our ability to subsequently extract information from them. Machine learning promises to automatically determine efficient representations from large unstructured datasets, such as those arising in biology. However, empirical evidence suggests that seemingly minor changes to these machine learning models yield drastically different data representations that result in different biological interpretations of data. This begs the question of what even constitutes the most meaningful representation. Here, we approach this question for representations of protein sequences, which have received considerable attention in the recent literature. We explore two key contexts in which representations naturally arise: transfer learning and interpretable learning. In the first context, we demonstrate that several contemporary practices yield suboptimal performance, and in the latter we demonstrate that taking representation geometry into account significantly improves interpretability and lets the models reveal biological information that is otherwise obscured.

15 May 2023 in eLife
Verified
Journal Article
Open access
LBLasse M Blaabjerg
Lasse M Blaabjerg
MKMaher M Kassem
Maher M Kassem
LGLydia L Good
Lydia L Good
NJNicolas Jonsson
Nicolas Jonsson
MCMatteo Cagiada
Matteo Cagiada
KLKresten Lindorff-Larsen
Kresten Lindorff-Larsen
Predicting the thermodynamic stability of proteins is a common and widely used step in protein engineering, and when elucidating the molecular mechanisms behind evolution and disease. Here, we present RaSP, a method for making rapid and accurate predictions of changes in protein stability by leveraging deep learning representations. RaSP performs on-par with biophysics-based methods and enables saturation mutagenesis stability predictions in less than a second per residue. We use RaSP to calculate ∼ 230 million stability changes for nearly all single amino acid changes in the human proteome, and examine variants observed in the human population. We find that variants that are common in the population are substantially depleted for severe destabilization, and that there are substantial differences between benign and pathogenic variants, highlighting the role of protein stability in genetic diseases. RaSP is freely available—including via a Web interface—and enables large-scale analyses of stability in experimental and predicted protein structures.

1 July 2008 in Proceedings of the National Academy of Sciences
Verified
Journal Article
Open access
PDF file
WBWouter Boomsma
Wouter Boomsma
KMKanti V. Mardia
Kanti V. Mardia
CTCharles C. Taylor
Charles C. Taylor
JFJesper Ferkinghoff-Borg
Jesper Ferkinghoff-Borg
AKAnders Krogh
Anders Krogh
THThomas Hamelryck
Thomas Hamelryck
Despite significant progress in recent years, protein structure prediction maintains its status as one of the prime unsolved problems in computational biology. One of the key remaining challenges is an efficient probabilistic exploration of the structural space that correctly reflects the relative conformational stabilities. Here, we present a fully probabilistic, continuous model of local protein structure in atomic detail. The generative model makes efficient conformational sampling possible and provides a framework for the rigorous analysis of local sequence–structure correlations in the native state. Our method represents a significant theoretical and practical improvement over the widely used fragment assembly technique by avoiding the drawbacks associated with a discrete and nonprobabilistic approach.