PCSF_rand: Prize-collecting Steiner Forest (PCSF) with randomized edge...

Description Usage Arguments Details Value Author(s) References See Also Examples

Description

PCSF_rand returns a union of subnetworks obtained by solving the PCSF on the given interaction network by adding a random noise to edge costs each time.

Usage

1
PCSF_rand(ppi, terminals, n = 10, r = 0.1, w = 2, b = 1, mu = 5e-04)

Arguments

ppi

An interaction network as an igraph object.

terminals

A list of terminal genes with prizes to be analyzed in the PCSF context. A named numeric vector, where terminal genes are named same as in the interaction network and numeric values correspond to the importance of the gene within the study.

n

An integer value to determine the number of runs with random noise added edge costs. A default value is 10.

r

A numeric value to determine additional random noise to edge costs. A random noise upto r percent of the edge cost is added to each edge. A default value is 0.1

w

A numeric value for tuning the number of trees in the output. A default value is 2.

b

A numeric value for tuning the node prizes. A default value is 1.

mu

A numeric value for a hub penalization. A default value is 0.0005.

Details

In order to increase the robustness of the resulting structure, it is recommended to solve the PCSF several times on the same network while adding some noise to the edge costs each time, and combine all results in a final subnetwork. The union of all outputs may explain the underlying biology better.

Value

The final subnetwork obtained by taking the union of the PCSF outputs generated by adding a random noise to edge costs each time. It returns an igraph object with the node prize and edge cost attributes representing the total number of show ups throughout all runs.

Author(s)

Murodzhon Akhmedov

References

Akhmedov M., LeNail A., Bertoni F., Kwee I., Fraenkel E., and Montemanni R. (2017) A Fast Prize-Collecting Steiner Forest Algorithm for Functional Analyses in Biological Networks. Lecture Notes in Computer Science, to appear.

See Also

PCSF, plot.PCSFe

Examples

1
2
3
4
5
6
7
8
## Not run: 
library("PCSF")
data("STRING")
data("Tgfb_phospho")
terminals <- Tgfb_phospho
ppi <- construct_interactome(STRING)
subnet <- PCSF_rand(ppi, terminals, n = 10, r =0.1, w = 2, b = 2, mu = 0.0005)
## End(Not run)

murodzhon/PCSF documentation built on May 14, 2019, 10:35 a.m.