Optimising orbit counting of arbitrary order by equation selection

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...

Full description

Bibliographic Details
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:
Graph theory
Graphlets
Orbits
Equations
Optimisation
Cytoscape app
Online Access:http://link.springer.com/article/10.1186/s12859-018-2483-9

Internet

http://link.springer.com/article/10.1186/s12859-018-2483-9

Similar Items