AnalyzeAlignment {GraphAlignment} R Documentation

## Analyze an alignment

### Description

Analyze an alignment between two networks.

### Usage

```AnalyzeAlignment(A, B, R, P, lookupNode, epsilon)
```

### Arguments

 `A` adjacency matrix for network A `B` adjacency matrix for network B `R` node similarity matrix `P` permutation vector `lookupNode` node bin lookup vector `epsilon` node similarity threshold

### Value

The return value is a list containing the results. Defined values are:
na - number of aligned node pairs
nb - number of aligned node pairs where neither partner has appreciable sequence similarity with any node in the other network. Appreciable sequence similarity means that r>epsilon. Formally, this is the number of aligned node pairs (ia, ib), where no jb exists such that R[ia, jb] > epsilon and no ja such that R[ja, ib] > epsilon.
nc - number of aligned node pairs, where the partners have no appreciable sequence similarity, but one or both of them has appreciable sequence similarity with some other node in the other network. Formally, this is the number of aligned node pairs (ia, ib) with R[ia, ib] < epsilon but jb or ja exists, such that R[ia, jb] > epsilon or R[ja, ib] > epsilon.

### Examples

```  ex<-GenerateExample(dimA=22, dimB=22, filling=.5, covariance=.6,
symmetric=TRUE, numOrths=10, correlated=seq(1,18))

pinitial<-InitialAlignment(psize=34, r=ex\$r, mode="reciprocal")

lookupNode<-c(-.5,.5,1.5)
nodeParams<-ComputeNodeParameters(dimA=22, dimB=22, ex\$r,
pinitial, lookupNode)

al<-AlignNetworks(A=ex\$a, B=ex\$b, R=ex\$r, P=pinitial,