<?xml version="1.0" encoding="UTF-8"?>
<oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:title>A Method for 'Connecting The Dots' in Weighted Graphs</dc:title>
  <dc:title>R package CTD version 1.3</dc:title>
  <dc:description>A method for pattern discovery in weighted graphs as outlined in Thistlethwaite et al. (2021) &lt;doi:10.1371/journal.pcbi.1008550&gt;. 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?</dc:description>
  <dc:type>Software</dc:type>
  <dc:relation>Depends: R (&gt;= 4.0), igraph, stats, grDevices, graphics</dc:relation>
  <dc:relation>Suggests: knitr, rmarkdown, huge, ggplot2, gplots, RColorBrewer,
testthat</dc:relation>
  <dc:creator>Varduhi Petrosyan &lt;varduhi.petrosyan@bcm.edu&gt;</dc:creator>
  <dc:publisher>Comprehensive R Archive Network (CRAN)</dc:publisher>
  <dc:contributor>Varduhi Petrosyan [aut, cre],
  Lillian Thistlethwaite [aut]</dc:contributor>
  <dc:rights>MIT + file LICENSE (https://CRAN.R-project.org/package=CTD/LICENSE)</dc:rights>
  <dc:date>2024-08-16</dc:date>
  <dc:format>application/tgz</dc:format>
  <dc:identifier>https://CRAN.R-project.org/package=CTD</dc:identifier>
  <dc:identifier>doi:10.32614/CRAN.package.CTD</dc:identifier>
</oai_dc:dc>