A lightweight implementation of Walklets from "Don't Walk Skip! Online Learning of Multi-scale Network Embeddings" (ASONAM 2017).

A sparsity aware implementation of "Biological Network Comparison Using Graphlet Degree Distribution" (Bioinformatics 2007)

Standalone c++ implementation for computing Motif Adjacency Matrices of large directed networks, for 3-node graphlets and 4-node graphletsa containing a 4 edge loop.

Parameter advising for biological pathway creation algorithms

A Python package to extract graphlet patterns within text documents represented as word graphs. The package can be used for text genres analysis and text feature engineering.

Work we did for a practical course in graph learning, organized by department Informatik 7 at RWTH University