Advertisement

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
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 803)

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

Subgraph isomorphism Networks biology Search strategy 

References

  1. 1.
    Bonnici, V., Busato, F., Micale, G., Bombieri, N., Pulvirenti, A., Giugno, R.: Appagato: An approximate parallel and stochastic graph querying tool for biological networks. Bioinformatics 32(14), 2159–2166 (2016). Cited by: 2Google Scholar
  2. 2.
    Bonnici, V., Giugno, R.: On the variable ordering in subgraph isomorphism algorithms. IEEE/ACM Trans. Comput. Biol. Bioinf. 14(1), 193–203 (2017)CrossRefGoogle Scholar
  3. 3.
    Bonnici, V., Giugno, R., Pulvirenti, A., Shasha, D., Ferro, A.: A subgraph isomorphism algorithm and its application to biochemical data. BMC Bioinf. 14(Suppl 7), S13 (2013)CrossRefGoogle Scholar
  4. 4.
    Carletti, V., Foggia, P., Saggese, A., Vento, M.: Challenging the time complexity of exact subgraph isomorphism for huge and dense graphs with vf3. IEEE Trans. Pattern Anal. Mach. Intell. PP(99), 1 (2017)Google Scholar
  5. 5.
    Giugno, R., Bonnici, V., Bombieri, N., Pulvirenti, A., Ferro, A., Shasha, D.: Grapes: a software for parallel searching on biological graphs targeting multi-core architectures. PLoS ONE 8(10) (2013). Cited by: 10Google Scholar
  6. 6.
    Haralick, R.M., Elliott, G.L.: Increasing tree search efficiency for constraint satisfaction problems. Artif. Intell. 14(3), 263–313 (1980)CrossRefGoogle Scholar
  7. 7.
    McGregor, J.: Relational consistency algorithms and their application in finding subgraph and graph isomorphisms. Inf. Sci. 19(3), 229–250 (1979)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Micale, G., Giugno, R., Ferro, A., Mongiovì, M., Shasha, D., Pulvirenti, A.: Fast analytical methods for finding significant labeled graph motifs. Data Min. Knowl. Discov. 32, 504–531 (2017)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Michael, R.G., David, S.J.: Computers and Intractability: A Guide to the Theory of NP-Completeness, pp. 90–91. WH Free. Co., San Francisco (1979)Google Scholar
  10. 10.
    Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network motifs: simple building blocks of complex networks. Science 298(5594), 824–827 (2002)CrossRefGoogle Scholar
  11. 11.
    Palsson, B., Zengler, K.: The challenges of integrating multi-omic data sets. Nat. Chem. Biol. 6, 787–789 (2010)CrossRefGoogle Scholar
  12. 12.
    Solnon, C.: Alldifferent-based filtering for subgraph isomorphism. Artif. Intell. 174(12), 850–864 (2010)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Ullmann, J.R.: Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism. J. Exp. Algorithmics 15, 1.6:1.1-1.6:1.64 (2011)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Antonino Aparo
    • 1
  • Vincenzo Bonnici
    • 1
  • Giovanni Micale
    • 2
  • Alfredo Ferro
    • 2
  • Dennis Shasha
    • 3
  • Alfredo Pulvirenti
    • 2
  • Rosalba Giugno
    • 1
  1. 1.University of VeronaVeronaItaly
  2. 2.University of CataniaCataniaItaly
  3. 3.New York UniversityNew YorkUSA

Personalised recommendations