Subgraph: Use genetic algorithm to identify maximally scoring subgraph

In idroz/gasub: R package for extraction of active subnetworks using a global search algorithm

Description

Use genetic algorithm to identify maximally scoring subgraph

Usage

Subgraph(graph, weights, pop.size = 50, max.iter = 100,
  run = vcount(graph), p.mutation = 0.1, eletism = max(1, round(pop.size *
  0.05)), ncores = 1)

Arguments

graph	a named igraph object
weights	a named numeric vector
pop.size	integer
max.iter	integer
run	integer
p.mutation	float. Probability of mutation
eletism	integer
ncores	integer

idroz/gasub documentation built on May 18, 2019, 2:33 a.m.