Motivation: Biological network querying is a problem requiring a considerable computational effort tobe solved. Given a target and a query network, it aims to find occurrences of the query in the target byconsidering topological and node similarities (i.e. mismatches between nodes, edges, or node labels).Querying tools that deal with similarities are crucial in biological network analysis since they providemeaningful results also in case of noisy data. In addition, since the size of available networks increasessteadily, existing algorithms and tools are becoming unsuitable. This is rising new challenges for the designof more efficient and accurate solutions.Results: This paper presents APPAGATO, a stochastic and parallel algorithm to find approximateoccurrences of a query network in biological networks. APPAGATO handles node, edge, and node labelmismatches. Thanks to its randomic and parallel nature, it applies to large networks and, compared toexisting tools, it provides higher performance as well as statistically significant more accurate results.Tests have been performed on protein-protein interaction networks annotated with synthetic and real geneontology terms. Case studies have been done by querying protein complexes among different species andtissues

APPAGATO: an APproximate PArallel and stochastic GrAph querying TOol for biological networks

Bonnici Vincenzo;Busato Federico;Bombieri Nicola;Giugno Rosalba
2016

Abstract

Motivation: Biological network querying is a problem requiring a considerable computational effort tobe solved. Given a target and a query network, it aims to find occurrences of the query in the target byconsidering topological and node similarities (i.e. mismatches between nodes, edges, or node labels).Querying tools that deal with similarities are crucial in biological network analysis since they providemeaningful results also in case of noisy data. In addition, since the size of available networks increasessteadily, existing algorithms and tools are becoming unsuitable. This is rising new challenges for the designof more efficient and accurate solutions.Results: This paper presents APPAGATO, a stochastic and parallel algorithm to find approximateoccurrences of a query network in biological networks. APPAGATO handles node, edge, and node labelmismatches. Thanks to its randomic and parallel nature, it applies to large networks and, compared toexisting tools, it provides higher performance as well as statistically significant more accurate results.Tests have been performed on protein-protein interaction networks annotated with synthetic and real geneontology terms. Case studies have been done by querying protein complexes among different species andtissues
Approximate graph querying; GPU; biological networks
File in questo prodotto:
File Dimensione Formato  
document.pdf

accesso aperto

Tipologia: Versione dell'editore
Licenza: Creative commons
Dimensione 2.04 MB
Formato Adobe PDF
2.04 MB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11562/938919
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 9
  • ???jsp.display-item.citation.isi??? 9
social impact