The hardware and bandwidth for this mirror is donated by dogado GmbH, the Webhosting and Full Service-Cloud Provider. Check out our Wordpress Tutorial.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]dogado.de.
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
 [aut],
Guido Schwarzer
[aut],
Theodoros Papakonstantinou
[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 |
Documentation:
Downloads:
Linking:
Please use the canonical form
https://CRAN.R-project.org/package=nmarank
to link to this page.
These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.
Health stats visible at Monitor.