-
Notifications
You must be signed in to change notification settings - Fork 0
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
bidirectional motifs and positions #5
Comments
I'll follow the motifs order as in fig. 1 in Milo 2002, for each motif I'll do every position so that we have a clear mapping between position and motif and so it'll be easy to get a count of motif based on the count of positions. |
Depending on the performance it'd may be make sense to use the function even for unidirectional network. |
Why not do it for 4-species motifs as well? |
too many positions (256).... unless there is a smart way to proceed I won't do that 😆 ! |
👍 haha fair enough! |
See d0556c4 |
Performance-wise there is still a small advantage using the unidirectional implementation
|
Would be good to have another function that handle bidirectional network for 3 nodes motifs.
It'd mean to handle 64 cases, quite boring to write but there might be a way of writing it smartly using boolean algebra!
edit ✏️
What remains is:
motif_census()
, especially to list the position for the bidirecitonal case;The text was updated successfully, but these errors were encountered: