Created
May 8, 2012 17:16
-
-
Save gajomi/2637517 to your computer and use it in GitHub Desktop.
Method for counting disjoint pairwise motifs in N^2
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| N = 5; | |
| C = triu(ones(N,N)); | |
| A = C(1:N,N:-1:1); | |
| A(N,N) = 1; | |
| D = A*ones(N,N)*A - A^3; | |
| H = (A==0).*D/2; | |
| U = sum(H(:)) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment