CTD

A Method for 'Connecting The Dots' in Weighted Graphs

Lillian R. Thistlethwaite, Varduhi Petrosyan

Last update: 24 October 2023

Copyright license: MIT license, File License

Software version identifier: 0.99.8, 1.0.0, 1.1.0, 1.2

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?

Cites work

CTD: An information-theoretic algorithm to interpret sets of metabolomic and transcriptomic perturbations in the context of graphical models

This page was built for software: CTD