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

Research output: Chapter in Book/Report/Conference proceedingChapter

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.
Original languageEnglish
Title of host publicationEncyclopedia of Bioinformatics and Computational Biology
Pages95-101
Number of pages7
Publication statusPublished - 2019

Fingerprint

Dive into the research topics of 'Algorithms for Graph and Network Analysis: Clustering and Search of Motifs in Graphs'. Together they form a unique fingerprint.

Cite this