201. Optimising orbit counting of arbitrary order by equation selection
- Author
-
Thomas Van Parys, Didier Colle, Mario Pickavet, Yves Van de Peer, Pieter Audenaert, and Ine Melckenbeeck
- Subjects
Dense graph ,Equations ,Computer science ,optimisation ,graph theory ,Graphlets ,Structure (category theory) ,orbits ,Orbits ,Cytoscape App ,Type (model theory) ,lcsh:Computer applications to medicine. Medical informatics ,Biochemistry ,Models, Biological ,03 medical and health sciences ,0302 clinical medicine ,Structural Biology ,graphlets ,equations ,Protein Interaction Mapping ,Computer Graphics ,Diabetes Mellitus ,Humans ,Optimisation ,Computer Simulation ,lcsh:QH301-705.5 ,Molecular Biology ,030304 developmental biology ,0303 health sciences ,Applied Mathematics ,Computational Biology ,Proteins ,Order by ,Graph theory ,Cytoscape app ,SCALE-FREE ,Science General ,Graph ,Computer Science Applications ,lcsh:Biology (General) ,030220 oncology & carcinogenesis ,Data Interpretation, Statistical ,Orbit (dynamics) ,lcsh:R858-859.7 ,Graph (abstract data type) ,Algorithm ,Software ,Algorithms - 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 of any order. To do so, it generates the required internal structures and equations automatically. Many more redundant equations are generated, however, and Jesse's running time is highly dependent on which of these equations are used. Therefore, this paper aims to investigate which equations are most efficient, and which factors have an effect on this efficiency.Results: With appropriate equation selection, Jesse's running time may be reduced by a factor of up to 2 in the best case, compared to using randomly selected equations. Which equations are most efficient depends on the density of the graph, but barely on the graph type. At low graph density, equations with terms in their right-hand side with few arguments are more efficient, whereas at high density, equations with terms with many arguments in the right-hand side are most efficient. At a density between 0.6 and 0.7, both types of equations are about equally efficient.Conclusions: Our Jesse algorithm became up to a factor 2 more efficient, by automatically selecting the best equations based on graph density. It was adapted into a Cytoscape App that is freely available from the Cytoscape App Store to ease application by bioinformaticians.
- Published
- 2019