rang: Reconstructing reproducible R computational environments.
Journal
PloS one
ISSN: 1932-6203
Titre abrégé: PLoS One
Pays: United States
ID NLM: 101285081
Informations de publication
Date de publication:
2023
2023
Historique:
received:
15
03
2023
accepted:
23
05
2023
medline:
12
6
2023
pubmed:
8
6
2023
entrez:
8
6
2023
Statut:
epublish
Résumé
A complete declarative description of the computational environment is usually missing when researchers share their materials. Without such description, software obsolescence and missing system components can jeopardize computational reproducibility in the future, even when data and computer code are available. The R package rang is a complete solution for generating the declarative description for other researchers to automatically reconstruct the computational environment at a specific time point. The reconstruction process, based on Docker, has been tested for R code as old as 2001. The declarative description generated by rang satisfies the definition of a reproducible research compendium and can be shared as such. In this contribution, we show how rang can be used to make otherwise unexecutable code, spanning fields such as computational social science and bioinformatics, executable again. We also provide instructions on how to use rang to construct reproducible and shareable research compendia of current research. The package is currently available from CRAN (https://cran.r-project.org/web/packages/rang/index.html) and GitHub (https://github.com/chainsawriot/rang).
Identifiants
pubmed: 37289797
doi: 10.1371/journal.pone.0286761
pii: PONE-D-23-07706
pmc: PMC10249795
doi:
Types de publication
Journal Article
Langues
eng
Sous-ensembles de citation
IM
Pagination
e0286761Informations de copyright
Copyright: © 2023 Chan, Schoch. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Déclaration de conflit d'intérêts
The authors have declared that no competing interests exist.
Références
Bioinformatics. 2014 Oct;30(19):2808-10
pubmed: 24903420
Gigascience. 2018 Jul 1;7(7):
pubmed: 29961842
Sci Data. 2022 Feb 21;9(1):60
pubmed: 35190569
Nat Ecol Evol. 2023 May;7(5):626-627
pubmed: 36849538
Psychol Sci. 2023 Apr;34(4):512-522
pubmed: 36730433
Psychol Sci. 2019 Apr;30(4):606-616
pubmed: 30843758