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.3-0
Depends: R (≥ 4.0.0), meta, netmeta (≥ 2.7-0)
Imports: dplyr, tibble, rlang, MASS, data.tree, mvtnorm, tidyr
Suggests: testthat
Published: 2023-02-24
DOI: 10.32614/CRAN.package.nmarank
Author: Adriani Nikolakopoulou ORCID iD [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/tpapak/nmarank
NeedsCompilation: no
Materials: NEWS
In views: MetaAnalysis
CRAN checks: nmarank results


Reference manual: nmarank.pdf


Package source: nmarank_0.3-0.tar.gz
Windows binaries: r-devel: nmarank_0.3-0.zip, r-release: nmarank_0.3-0.zip, r-oldrel: nmarank_0.3-0.zip
macOS binaries: r-release (arm64): nmarank_0.3-0.tgz, r-oldrel (arm64): nmarank_0.3-0.tgz, r-release (x86_64): nmarank_0.3-0.tgz, r-oldrel (x86_64): nmarank_0.3-0.tgz
Old sources: nmarank archive


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