Nothing
CTD: A Method for 'Connecting The Dots' in Weighted Graphs
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?
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Varduhi Petrosyan [aut, cre], Lillian Thistlethwaite [aut] |
| Maintainer | Varduhi Petrosyan <varduhi.petrosyan@bcm.edu> |
| License | MIT + file LICENSE |
| Version | 1.3 |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the CTD package in your browser
Any scripts or data that you put into this service are public.
