Fast Subgraph Matching Strategies Based on Pattern-Only Heuristics

Antonino Aparo, Vincenzo Bonnici, Giovanni Micale, Alfredo Ferro, Dennis Shasha, Alfredo Pulvirenti, Rosalba Giugno

Research output: Contribution to journalArticle

Abstract

Many scientific applications entail solving the subgraph isomorphism problem, i.e., given an input pattern graph, find all the subgraphs of a (usually much larger) target graph that are structurally equivalent to that input. Because subgraph isomorphism is NP-complete, methods to solve it have to use heuristics. This work evaluates subgraph isomorphism methods to assess their computational behavior on a wide range of synthetic and real graphs. Surprisingly, our experiments show that, among the leading algorithms, certain heuristics based only on pattern graphs are the most efficient.

Original languageEnglish (US)
Pages (from-to)21-32
Number of pages12
JournalInterdisciplinary Sciences: Computational Life Sciences
Volume11
Issue number1
DOIs
StatePublished - Mar 1 2019

Fingerprint

Heuristic algorithms
Experiments
Heuristics

Keywords

  • Networks biology
  • Search strategy
  • Subgraph isomorphism

ASJC Scopus subject areas

  • Biochemistry, Genetics and Molecular Biology(all)
  • Computer Science Applications
  • Health Informatics

Cite this

Fast Subgraph Matching Strategies Based on Pattern-Only Heuristics. / Aparo, Antonino; Bonnici, Vincenzo; Micale, Giovanni; Ferro, Alfredo; Shasha, Dennis; Pulvirenti, Alfredo; Giugno, Rosalba.

In: Interdisciplinary Sciences: Computational Life Sciences, Vol. 11, No. 1, 01.03.2019, p. 21-32.

Research output: Contribution to journalArticle

Aparo, Antonino ; Bonnici, Vincenzo ; Micale, Giovanni ; Ferro, Alfredo ; Shasha, Dennis ; Pulvirenti, Alfredo ; Giugno, Rosalba. / Fast Subgraph Matching Strategies Based on Pattern-Only Heuristics. In: Interdisciplinary Sciences: Computational Life Sciences. 2019 ; Vol. 11, No. 1. pp. 21-32.
@article{6fd006bc36e14228b63befdb748062e4,
title = "Fast Subgraph Matching Strategies Based on Pattern-Only Heuristics",
abstract = "Many scientific applications entail solving the subgraph isomorphism problem, i.e., given an input pattern graph, find all the subgraphs of a (usually much larger) target graph that are structurally equivalent to that input. Because subgraph isomorphism is NP-complete, methods to solve it have to use heuristics. This work evaluates subgraph isomorphism methods to assess their computational behavior on a wide range of synthetic and real graphs. Surprisingly, our experiments show that, among the leading algorithms, certain heuristics based only on pattern graphs are the most efficient.",
keywords = "Networks biology, Search strategy, Subgraph isomorphism",
author = "Antonino Aparo and Vincenzo Bonnici and Giovanni Micale and Alfredo Ferro and Dennis Shasha and Alfredo Pulvirenti and Rosalba Giugno",
year = "2019",
month = "3",
day = "1",
doi = "10.1007/s12539-019-00323-0",
language = "English (US)",
volume = "11",
pages = "21--32",
journal = "Interdisciplinary sciences, computational life sciences",
issn = "1913-2751",
publisher = "Springer Verlag",
number = "1",

}

TY - JOUR

T1 - Fast Subgraph Matching Strategies Based on Pattern-Only Heuristics

AU - Aparo, Antonino

AU - Bonnici, Vincenzo

AU - Micale, Giovanni

AU - Ferro, Alfredo

AU - Shasha, Dennis

AU - Pulvirenti, Alfredo

AU - Giugno, Rosalba

PY - 2019/3/1

Y1 - 2019/3/1

N2 - Many scientific applications entail solving the subgraph isomorphism problem, i.e., given an input pattern graph, find all the subgraphs of a (usually much larger) target graph that are structurally equivalent to that input. Because subgraph isomorphism is NP-complete, methods to solve it have to use heuristics. This work evaluates subgraph isomorphism methods to assess their computational behavior on a wide range of synthetic and real graphs. Surprisingly, our experiments show that, among the leading algorithms, certain heuristics based only on pattern graphs are the most efficient.

AB - Many scientific applications entail solving the subgraph isomorphism problem, i.e., given an input pattern graph, find all the subgraphs of a (usually much larger) target graph that are structurally equivalent to that input. Because subgraph isomorphism is NP-complete, methods to solve it have to use heuristics. This work evaluates subgraph isomorphism methods to assess their computational behavior on a wide range of synthetic and real graphs. Surprisingly, our experiments show that, among the leading algorithms, certain heuristics based only on pattern graphs are the most efficient.

KW - Networks biology

KW - Search strategy

KW - Subgraph isomorphism

UR - http://www.scopus.com/inward/record.url?scp=85062723243&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85062723243&partnerID=8YFLogxK

U2 - 10.1007/s12539-019-00323-0

DO - 10.1007/s12539-019-00323-0

M3 - Article

VL - 11

SP - 21

EP - 32

JO - Interdisciplinary sciences, computational life sciences

JF - Interdisciplinary sciences, computational life sciences

SN - 1913-2751

IS - 1

ER -