Find Modules with iGraph Fast and Greedy algorithm

This function wraps permutations of finding modules with igraph::cluster_fast_greedy().

Usage

findModules.fast_greedy(adj, nperm = 10, min.module.size = 30)

Arguments

adj

A n x n upper triangular adjacency in the matrix class format.

nperm

Optional. Number of permutation on the gene ordering. (Default = 10)

min.module.size

Optional. Integer between 1 and n genes. (Default = 30)

Value

GeneModules = n x 3 dimensional data frame with column names as Gene.ID, moduleNumber, and moduleLabel.