Salta al contenuto principale
Passa alla visualizzazione normale.

SIMONA ESTER ROMBO

Algorithms for Graph and Network Analysis: Clustering and Search of Motifs in Graphs

Abstract

In this article we deal with problems that involve the analysis of topology in graphs modeling biological networks. In particular, we consider two important problems: (i) Network clustering, aiming at finding compact subgraphs inside the input graph in order to isolate molecular complexes, and (ii) searching for motifs, i.e., sub-structures repeated in the input network and presenting high significance (e.g., in terms of their frequency). We provide a compact overview of the main techniques proposed in the literature to solve these problems.