nmarank: Complex Hierarchy Questions in Network Meta-Analysis

Derives the most frequent hierarchies along with their probability of occurrence. One can also define complex hierarchy criteria and calculate their probability. Methodology based on Papakonstantinou et al. (2021) <doi:10.21203/rs.3.rs-858140/v1>.

Version: 0.2-3
Depends: R (≥ 3.3.1), meta (≥ 4.19-1), netmeta (≥ 1.5-0), data.tree, mvtnorm, tidyr
Imports: dplyr, tibble, rlang
Suggests: testthat
Published: 2021-09-19
Author: Adriani Nikolakopoulou [aut], Guido Schwarzer ORCID iD [aut], Theodoros Papakonstantinou ORCID iD [aut, cre]
Maintainer: Theodoros Papakonstantinou <dev at tpapak.com>
License: GPL-3
URL: https://github.com/esm-ispm-unibe-ch/nmarank
NeedsCompilation: no
Materials: NEWS
In views: MetaAnalysis
CRAN checks: nmarank results


Reference manual: nmarank.pdf


Package source: nmarank_0.2-3.tar.gz
Windows binaries: r-devel: nmarank_0.2-3.zip, r-release: nmarank_0.2-3.zip, r-oldrel: nmarank_0.2-3.zip
macOS binaries: r-release (arm64): nmarank_0.2-3.tgz, r-release (x86_64): nmarank_0.2-3.tgz, r-oldrel: nmarank_0.2-3.tgz


Please use the canonical form https://CRAN.R-project.org/package=nmarank to link to this page.