Package: nmarank
Title: Complex Hierarchy Questions in Network Meta-Analysis
Version: 0.2-3
Date: 2021-09-16
Depends: R (>= 3.3.1), meta (>= 4.19-1), netmeta (>= 1.5-0), data.tree,
        mvtnorm, tidyr
Imports: dplyr, tibble, rlang
Suggests: testthat
Authors@R: c(person("Adriani", "Nikolakopoulou",
                    role = "aut"),
             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],
  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>
URL: https://github.com/esm-ispm-unibe-ch/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.1.2
NeedsCompilation: no
Packaged: 2021-09-17 08:08:14 UTC; tosku
Repository: CRAN
Date/Publication: 2021-09-19 07:20:02 UTC
Built: R 4.0.2; ; 2021-09-20 10:51:45 UTC; unix
