add.adjacency: add.adjacency

In npollesch/AOPNet: Adverse Outcome Pathway Network Analysis Tools

Description

Adds $adjacency edge attribute: Algorithm Description STEP 1: Potenial non-adjacent KERs identified when distance between KEup and KEdown can be greater than two KEs STEP 2: Longest unique paths between "origin" to "terminus" pairs identified. NOTE: "Origin" and "terminus" are used instead of MIE/AO to account for incomplete AOPs that do not have the MIE or AO specified yet STEP 3: A KER is non-adjacent if its KEs have a possible distance >2 (Step 1) AND DOES NOT occur in any longest unique path (Step 2)

Usage

add.adjacency(g)

Arguments

g	Must be an igraph object all vertices must have an attributes called "KE_KED" (Key Event Designator), with values of "MIE", "KE", or "AO" [igraph object]

Value

identical igraph object as input, with new edge attribute called $adjacency [igraph object]

npollesch/AOPNet documentation built on Jan. 9, 2021, 12:39 a.m.