Package: nmarank
Title: Complex Hierarchy Questions in Network Meta-Analysis
Version: 0.3-0.1
Date: 2023-02-23
Depends: R (>= 4.0.0), meta, netmeta (>= 2.7-0)
Imports: dplyr, tibble, rlang, MASS, data.tree, mvtnorm, tidyr
Suggests: testthat
Authors@R: c(person("Adriani", "Nikolakopoulou",
                    role = "aut",
		    comment = c(ORCID = "0000-0001-5884-4319")),
             person("Guido", "Schwarzer",
                    role = "aut",
                    comment = c(ORCID = "0000-0001-6214-9087")),
            person("Theodoros", "Papakonstantinou",
                    role = c("aut", "cre"),
                    email = "dev@tpapak.com",
                    comment = c(ORCID = "0000-0002-6630-6817"))
            )
Author: Adriani Nikolakopoulou [aut] (ORCID:
    <https://orcid.org/0000-0001-5884-4319>),
  Guido Schwarzer [aut] (ORCID: <https://orcid.org/0000-0001-6214-9087>),
  Theodoros Papakonstantinou [aut, cre] (ORCID:
    <https://orcid.org/0000-0002-6630-6817>)
Maintainer: Theodoros Papakonstantinou <dev@tpapak.com>
URL: https://github.com/tpapak/nmarank
Description: 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>.
License: GPL-3
Encoding: UTF-8
RoxygenNote: 7.3.3
NeedsCompilation: no
Packaged: 2025-12-29 14:59:10 UTC; hornik
Repository: CRAN
Date/Publication: 2025-12-29 15:36:17 UTC
Built: R 4.6.0; ; 2026-04-26 20:08:12 UTC; unix
