Optimising orbit counting of arbitrary order by equation selection
Abstract Background Graphlets are useful for bioinformatics network analysis. Based on the structure of Hočevar and Demšar’s ORCA algorithm, we have created an orbit counting algorithm, named Jesse. This algorithm, like ORCA, uses equations to count the orbits, but unlike ORCA it can count graphlets...
Main Authors: | Ine Melckenbeeck, Pieter Audenaert, Thomas Van Parys, Yves Van De Peer, Didier Colle, Mario Pickavet |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2019-01-01
|
Series: | BMC Bioinformatics |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1186/s12859-018-2483-9 |
Similar Items
-
An Algorithm to Automatically Generate the Combinatorial Orbit Counting Equations.
by: Ine Melckenbeeck, et al.
Published: (2016-01-01) -
Efficient orbit-aware triad and quad census in directed and undirected graphs
by: Mark Ortmann, et al.
Published: (2017-06-01) -
Computation of Graphlet Orbits for Nodes and Edges in Sparse Graphs
by: Tomaž Hočevar, et al.
Published: (2016-07-01) -
Comprehensive reconstruction andvisualization of non-coding regulatorynetworks in human
by: Vincenzo eBonnici, et al.
Published: (2014-12-01) -
CoExpNetViz: Comparative Co-expression Networks Construction and Visualization Tool
by: Oren eTzfadia, et al.
Published: (2016-01-01)