YonatanRosen/motifs-count-package
Motifs are basic sub-graphs of complex networks. This toolbox implements fast algorithm for counting network motifs. The included functions handle motifs of orders 3 and 4 in binary directed networks, in the scales of single vertex and the total network. The algorithm is detailed in: Itzhack Royi, Yelena Mogilevski, and Yoram Louzoun. "An optimal algorithm for counting network motifs." Physica A: Statistical Mechanics and its Applications 381 (2007): 482-490. Yoram Louzoun's lab: http://peptibase.cs.biu.ac.il/ Royi Itzhack's homepage: http://u.cs.biu.ac.il/~itschar/ Before applying the algorithm the input graph is converted to the graph object of Lev Muchnik's complex networks toolboox: http://www.levmuchnik.net/Content/Networks/ComplexNetworksPackage.html The package includes precompiled MEX files for Windows 64 bit. The package includes source code to compile on other platforms as well, see the included ReadMe file.
Cite As
Yonatan Rosen (2024). YonatanRosen/motifs-count-package (https://github.com/YonatanRosen/motifs-count-package), GitHub. Retrieved .
MATLAB Release Compatibility
Platform Compatibility
Windows macOS LinuxCategories
Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Discover Live Editor
Create scripts with code, output, and formatted text in a single executable document.
Graph
Graph/FastSet
Graph/FlexIO
motifs 4 source files
Versions that use the GitHub default branch cannot be downloaded
Version | Published | Release Notes | |
---|---|---|---|
1.0.0.0 |
|