TY - CHAP

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

AU - Rombo, Simona Ester

PY - 2019

Y1 - 2019

N2 - 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.

AB - 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.

UR - http://hdl.handle.net/10447/314272

UR - https://www.sciencedirect.com/science/article/pii/B978012809633820486X

M3 - Chapter

SN - 978-0-12-811432-2

SP - 95

EP - 101

BT - Encyclopedia of Bioinformatics and Computational Biology

ER -