esm-ispm-unibe-ch/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>.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Adriani Nikolakopoulou [aut], Guido Schwarzer [aut] (<https://orcid.org/0000-0001-6214-9087>), Theodoros Papakonstantinou [aut, cre] (<https://orcid.org/0000-0002-6630-6817>) |
| Maintainer | Theodoros Papakonstantinou <dev@tpapak.com> |
| License | GPL-3 |
| Version | 0.2-3 |
| URL | https://github.com/esm-ispm-unibe-ch/nmarank |
| Package repository | View on GitHub |
| Installation |
Install the latest version of this package by entering the following in R:
|
