Description Usage Arguments Value Examples
View source: R/generateHypotheses.R
Calculate shortest paths between all members of a binary interaction network. This function creates a table that contains all possible combinations of 2 from all input proteins (binomial coefficient (length(proteins) over 2)).
1 | calculatePathlength(binaryInteractionTable)
|
binaryInteractionTable |
data.table with binary interactions between "a" and "b" as returned from generateBinaryNetwork() |
data.table with three columns containing all possible combinations of proteins:
x,y: Protein ids of the input proteins (all possible combinations)
dist: distance (shortest path between interactors) as determined by the input binary interaction table
1 2 3 4 5 6 7 8 | ## Load example data
complexHypotheses <- exampleComplexHypotheses
## Generate the binary network
binaryInteractions <- generateBinaryNetwork(complex_hypotheses = complexHypotheses)
## Calculate the path lengths
shortestPaths <- calculatePathlength(binaryInteractions)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.