Combinatorial algorithm for counting small induced graphs and orbits.
Graphlet analysis is an approach to network analysis that is particularly popular in bioinformatics. We show how to set up a system of linear equations that relate the orbit counts and can be used in an algorithm that is significantly faster than the existing approaches based on direct enumeration o...
Main Authors: | Tomaž Hočevar, Janez Demšar |
---|---|
Format: | Article |
Language: | English |
Published: |
Public Library of Science (PLoS)
2017-01-01
|
Series: | PLoS ONE |
Online Access: | http://europepmc.org/articles/PMC5300269?pdf=render |
Similar Items
-
Computation of Graphlet Orbits for Nodes and Edges in Sparse Graphs
by: Tomaž Hočevar, et al.
Published: (2016-07-01) -
An Algorithm to Automatically Generate the Combinatorial Orbit Counting Equations.
by: Ine Melckenbeeck, et al.
Published: (2016-01-01) -
Randomised algorithms for counting and generating combinatorial structures
by: Sinclair, Alistair John
Published: (1988) -
An Algorithm for Counting the Fixed Point Orbits of an AND-OR Dynamical System with Symmetric Positive Dependency Graph
by: Mauro Mezzini, et al.
Published: (2020-09-01) -
Algorithmic issues in queueing systems and combinatorial counting problems
by: Katz-Rogozhnikov, Dmitriy A
Published: (2009)