No retraction, correction or concern found when last checked on Oct 29, 2026.
Sustainable data analysis with Snakemake
Felix Mölder, Kim Philipp Jablonski, Brice Letcher and 17 more
F1000Research · 2025
doi:10.12688/f1000research.29032.3
Abstract
Data analysis often entails a multitude of heterogeneous steps, from the application of various command line tools to the usage of scripting languages like R or Python for the generation of plots and tables. It is widely recognized that data analyses should ideally be conducted in a reproducible way. Reproducibility enables technical validation and regeneration of results on the original or even new data. However, reproducibility alone is by no means sufficient to deliver an analysis that is of lasting impact (i.e., sustainable) for the field, or even just one research group. We postulate that it is equally important to ensure adaptability and transparency. The former describes the ability to modify the analysis to answer extended or slightly different research questions. The latter describes the ability to understand the analysis in order to judge whether it is not only technically, but methodologically valid. Here, we analyze the properties needed for data analysis to become reproducible, adaptable, and transparent. We show how the popular workflow management system Snakemake can be used to guarantee this, and how it enables an ergonomic, combined, unified representation of all steps involved in data analysis, ranging from raw data processing, to quality control and fine-grained, interactive exploration and plotting of final results.
References 39
- 1.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 2.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 3.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 4.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 5.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 6.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 7.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 8.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 9.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 10.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 11.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 12.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 13.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 14.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 15.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 16.
- 17.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 18.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 19.
- 20.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 21.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 22.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 23.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 24.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 25.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 26.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 27.
- 28.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 29.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 30.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 31.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 32.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 33.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 34.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 35.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 36.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 37.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 38.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 39.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.