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>.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.3-0.1 |
rolling linux/jammy R-4.5 | nmarank_0.3-0.1.tar.gz |
66.5 KiB |
0.3-0.1 |
rolling linux/noble R-4.5 | nmarank_0.3-0.1.tar.gz |
66.4 KiB |
0.3-0.1 |
rolling source/ R- | nmarank_0.3-0.1.tar.gz |
13.5 KiB |
0.3-0.1 |
latest linux/jammy R-4.5 | nmarank_0.3-0.1.tar.gz |
66.5 KiB |
0.3-0.1 |
latest linux/noble R-4.5 | nmarank_0.3-0.1.tar.gz |
66.4 KiB |
0.3-0.1 |
latest source/ R- | nmarank_0.3-0.1.tar.gz |
13.5 KiB |
0.3-0.1 |
2026-04-26 source/ R- | nmarank_0.3-0.1.tar.gz |
13.5 KiB |
0.3-0.1 |
2026-04-23 source/ R- | nmarank_0.3-0.1.tar.gz |
13.5 KiB |
0.3-0.1 |
2026-04-09 windows/windows R-4.5 | nmarank_0.3-0.1.zip |
68.9 KiB |
0.3-0 |
2025-04-20 source/ R- | nmarank_0.3-0.tar.gz |
15.0 KiB |