Social network analysis

Predicts and explores important nodes and subnetworks in a given network by several topological algorithms.

It allows the user to do "Network Motif Discovery" in a fast and friendly way. It uses the G-Tries algorithm which is the fastest one.

Summarizes how individuals are connected by building networks where nodes represent authors and edges represent publications.

Expand node selection using network propagation algorithms

Compute links weights and assess the reliability of the links in a network (e.g. protein-protein interactions)