forked from BRL-BCM/CTD
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDESCRIPTION
executable file
·22 lines (22 loc) · 958 Bytes
/
DESCRIPTION
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
Package: CTD
Title: A Method for 'Connecting The Dots' in Weighted Graphs
Version: 1.1.0
Date: 2022-04-22
Maintainer: Lillian Thistlethwaite <[email protected]>
Author: Lillian Thistlethwaite [aut, cre]
Authors@R: person("Lillian", "Thistlethwaite", email="[email protected]", role=c("aut", "cre"))
Description: A method for pattern discovery in weighted graphs as outlined in Thistlethwaite et al. (2021) <doi:10.1371/journal.pcbi.1008550>. Two use cases are achieved: 1) Given a weighted graph and a subset of its nodes, do the nodes show significant connectedness? 2) Given a weighted graph and two subsets of its nodes, are the subsets close neighbors or distant?
Depends: R (>= 4.0), igraph, stats, grDevices, graphics
Suggests:
knitr,
rmarkdown,
huge,
ggplot2,
gplots,
RColorBrewer,
testthat
VignetteBuilder: knitr
License: MIT + file LICENSE
Encoding: UTF-8
LazyData: true
RoxygenNote: 7.1.2