Package: nmarank
Title: Complex Hierarchy Questions in Network Meta-Analysis
Version: 0.3-0
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] (<https://orcid.org/0000-0001-5884-4319>),
  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/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.2.3
NeedsCompilation: no
Packaged: 2023-02-24 14:27:09 UTC; tosku
Repository: CRAN
Date/Publication: 2023-02-24 14:50:02 UTC
Built: R 4.1.3; ; 2023-04-17 20:34:00 UTC; windows
