Journal
BIOINFORMATICS
Volume 30, Issue 4, Pages 559-565Publisher
OXFORD UNIV PRESS
DOI: 10.1093/bioinformatics/btt717
Keywords
-
Categories
Funding
- Slovenian Research Agency [P2-0209, J2-5480]
Ask authors/readers for more resources
Motivation: Small-induced subgraphs called graphlets are emerging as a possible tool for exploration of global and local structure of networks and for analysis of roles of individual nodes. One of the obstacles to their wider use is the computational complexity of algorithms for their discovery and counting. Results: We propose a new combinatorial method for counting graphlets and orbit signatures of network nodes. The algorithm builds a system of equations that connect counts of orbits from graphlets with up to five nodes, which allows to compute all orbit counts by enumerating just a single one. This reduces its practical time complexity in sparse graphs by an order of magnitude as compared with the existing pure enumeration-based algorithms.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available