Simple pattern-only heuristics lead to fast subgraph matching strategies on very large networks

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A wide range of biomedical applications entails solving the subgraph isomorphism problem, i.e. finding all the possible subgraphs of a target graph that are structurally equivalent to an input pattern graph. Targets may be very large and complex structures compared to patterns. Methods that address this NP-complete problem use heuristics. Their performance in both time and quality depends on a few subtleties of those heuristics. This paper compares the performance of state-of-the-art algorithms for subgraph isomorphism on small, medium and very large graphs. Results show that heuristics based on pattern graphs alone prove to be the most efficient, an unexpected result.

LanguageEnglish (US)
Title of host publicationPractical Applications of Computational Biology and Bioinformatics, 12th International Conference
EditorsMiguel Rocha, Mohd Saberi Mohamad, Juan F. De Paz, Florentino Fdez-Riverola, Pascual Gonzalez
PublisherSpringer-Verlag
Pages131-138
Number of pages8
ISBN (Print)9783319987019
DOIs
StatePublished - Jan 1 2019
Event12th International Conference on Practical Applications of Computational Biology and Bioinformatics, PACBB 2018 - Toledo, Spain
Duration: Jun 20 2018Jun 22 2018

Publication series

NameAdvances in Intelligent Systems and Computing
Volume803
ISSN (Print)2194-5357

Other

Other12th International Conference on Practical Applications of Computational Biology and Bioinformatics, PACBB 2018
CountrySpain
CityToledo
Period6/20/186/22/18

Fingerprint

Computational complexity

Keywords

  • Networks biology
  • Search strategy
  • Subgraph isomorphism

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science(all)

Cite this

Aparo, A., Bonnici, V., Micale, G., Ferro, A., Shasha, D., Pulvirenti, A., & Giugno, R. (2019). Simple pattern-only heuristics lead to fast subgraph matching strategies on very large networks. In M. Rocha, M. S. Mohamad, J. F. De Paz, F. Fdez-Riverola, & P. Gonzalez (Eds.), Practical Applications of Computational Biology and Bioinformatics, 12th International Conference (pp. 131-138). (Advances in Intelligent Systems and Computing; Vol. 803). Springer-Verlag. DOI: 10.1007/978-3-319-98702-6_16

Simple pattern-only heuristics lead to fast subgraph matching strategies on very large networks. / Aparo, Antonino; Bonnici, Vincenzo; Micale, Giovanni; Ferro, Alfredo; Shasha, Dennis; Pulvirenti, Alfredo; Giugno, Rosalba.

Practical Applications of Computational Biology and Bioinformatics, 12th International Conference. ed. / Miguel Rocha; Mohd Saberi Mohamad; Juan F. De Paz; Florentino Fdez-Riverola; Pascual Gonzalez. Springer-Verlag, 2019. p. 131-138 (Advances in Intelligent Systems and Computing; Vol. 803).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Aparo, A, Bonnici, V, Micale, G, Ferro, A, Shasha, D, Pulvirenti, A & Giugno, R 2019, Simple pattern-only heuristics lead to fast subgraph matching strategies on very large networks. in M Rocha, MS Mohamad, JF De Paz, F Fdez-Riverola & P Gonzalez (eds), Practical Applications of Computational Biology and Bioinformatics, 12th International Conference. Advances in Intelligent Systems and Computing, vol. 803, Springer-Verlag, pp. 131-138, 12th International Conference on Practical Applications of Computational Biology and Bioinformatics, PACBB 2018, Toledo, Spain, 6/20/18. DOI: 10.1007/978-3-319-98702-6_16
Aparo A, Bonnici V, Micale G, Ferro A, Shasha D, Pulvirenti A et al. Simple pattern-only heuristics lead to fast subgraph matching strategies on very large networks. In Rocha M, Mohamad MS, De Paz JF, Fdez-Riverola F, Gonzalez P, editors, Practical Applications of Computational Biology and Bioinformatics, 12th International Conference. Springer-Verlag. 2019. p. 131-138. (Advances in Intelligent Systems and Computing). Available from, DOI: 10.1007/978-3-319-98702-6_16
Aparo, Antonino ; Bonnici, Vincenzo ; Micale, Giovanni ; Ferro, Alfredo ; Shasha, Dennis ; Pulvirenti, Alfredo ; Giugno, Rosalba. / Simple pattern-only heuristics lead to fast subgraph matching strategies on very large networks. Practical Applications of Computational Biology and Bioinformatics, 12th International Conference. editor / Miguel Rocha ; Mohd Saberi Mohamad ; Juan F. De Paz ; Florentino Fdez-Riverola ; Pascual Gonzalez. Springer-Verlag, 2019. pp. 131-138 (Advances in Intelligent Systems and Computing).
@inproceedings{762d456b522a4784b29d03b2910477cf,
title = "Simple pattern-only heuristics lead to fast subgraph matching strategies on very large networks",
abstract = "A wide range of biomedical applications entails solving the subgraph isomorphism problem, i.e. finding all the possible subgraphs of a target graph that are structurally equivalent to an input pattern graph. Targets may be very large and complex structures compared to patterns. Methods that address this NP-complete problem use heuristics. Their performance in both time and quality depends on a few subtleties of those heuristics. This paper compares the performance of state-of-the-art algorithms for subgraph isomorphism on small, medium and very large graphs. Results show that heuristics based on pattern graphs alone prove to be the most efficient, an unexpected result.",
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 = "1",
day = "1",
doi = "10.1007/978-3-319-98702-6_16",
language = "English (US)",
isbn = "9783319987019",
series = "Advances in Intelligent Systems and Computing",
publisher = "Springer-Verlag",
pages = "131--138",
editor = "Miguel Rocha and Mohamad, {Mohd Saberi} and {De Paz}, {Juan F.} and Florentino Fdez-Riverola and Pascual Gonzalez",
booktitle = "Practical Applications of Computational Biology and Bioinformatics, 12th International Conference",

}

TY - GEN

T1 - Simple pattern-only heuristics lead to fast subgraph matching strategies on very large networks

AU - Aparo,Antonino

AU - Bonnici,Vincenzo

AU - Micale,Giovanni

AU - Ferro,Alfredo

AU - Shasha,Dennis

AU - Pulvirenti,Alfredo

AU - Giugno,Rosalba

PY - 2019/1/1

Y1 - 2019/1/1

N2 - A wide range of biomedical applications entails solving the subgraph isomorphism problem, i.e. finding all the possible subgraphs of a target graph that are structurally equivalent to an input pattern graph. Targets may be very large and complex structures compared to patterns. Methods that address this NP-complete problem use heuristics. Their performance in both time and quality depends on a few subtleties of those heuristics. This paper compares the performance of state-of-the-art algorithms for subgraph isomorphism on small, medium and very large graphs. Results show that heuristics based on pattern graphs alone prove to be the most efficient, an unexpected result.

AB - A wide range of biomedical applications entails solving the subgraph isomorphism problem, i.e. finding all the possible subgraphs of a target graph that are structurally equivalent to an input pattern graph. Targets may be very large and complex structures compared to patterns. Methods that address this NP-complete problem use heuristics. Their performance in both time and quality depends on a few subtleties of those heuristics. This paper compares the performance of state-of-the-art algorithms for subgraph isomorphism on small, medium and very large graphs. Results show that heuristics based on pattern graphs alone prove to be the most efficient, an unexpected result.

KW - Networks biology

KW - Search strategy

KW - Subgraph isomorphism

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

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

U2 - 10.1007/978-3-319-98702-6_16

DO - 10.1007/978-3-319-98702-6_16

M3 - Conference contribution

SN - 9783319987019

T3 - Advances in Intelligent Systems and Computing

SP - 131

EP - 138

BT - Practical Applications of Computational Biology and Bioinformatics, 12th International Conference

PB - Springer-Verlag

ER -