Background: BLOBFISH
Bipartite Limited Subnetworks from Multiple Observations using Breadth-First Search with Constrained Hops
- Objective: Find compact subnetwork connecting the members of a pre-specified set of genes
- Breadth-first search (Greedy algorithm) to go from a 'seed' set of nodes and create compact subnetwork
- Creates a bipartite subnetwork → therefore, only works with even number hop networks
- Computational inference (co-expression, Bayesian networks, etc.)
