bhmaxSubgraph {apComplex}R Documentation

Find maximal BH-complete subgraph

Description

Given an adjacency matrix of bait-hit AP-MS protein data, this function finds the maximal BH-complete subgraphs and reports them as an affiliation matrix.

Usage

bhmaxSubgraph(adjMat)

Arguments

adjMat adjMat is an N by (N+M) adjacency matrix with N equal to the number of bait proteins and M equal to the number of hit-only proteins. adjMat should have row and column names corresponding to the proteins in the experiment. An entry of "1" in the ith row and jth column of adjMat corresponds to bait protein i finding protein j as a hit. All other entries should be 0.

Details

A BH-complete subgraph with n bait nodes and m hit-only nodes for AP-MS data is defined as a subgraph for which all n*(n-1)+nm directed egdes exist. A maximal BH-complete subgraph is a BH-complete subgraph which is not contained in any other BH-complete subgraph.

This function assumes that the first N columns of adjMat form a symmetric matrix. For actual AP-MS data, this may not be true. It is up to the user to decide how best to symmetrize this part of the matrix.

Value

A matrix with (N+M) rows and a number of columns equal to the number of maximal BH-complete subgraphs. An entry of "1" in the ith row and jth column indicates membership of the ith protein in the jth maximal BH-complete subgraph.

Author(s)

Denise Scholtens

References

Scholtens, D. and Gentleman R. Making Sense of High Throughput Protein-Protein Interaction Data.

Examples


a <- matrix(c(1,1,1,1,1,0,1,0,1,1,1,0,1,1,1),nrow=3)
rownames(a) <- c("B1","B2","B3")
colnames(a) <- c("B1","B2","B3","H1","H2")

bhmaxSubgraph(a)


[Package apComplex version 1.0.1 Index]