The subgraph matching problem (subgraph isomorphism) is NP-complete. Previously, we designed
an exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach
(http://esmalgorithm.sourceforge.net). We further designed an approximate subgraph matching (ASM)
algorithm that is capable of detecting approximate subgraph matching based on a subgraph
distance. Assume that the graph G and the subgraph Gs have m and n vertices, and km and kn edges
respectively, the total worst-case algorithm complexity is O(m^n * n(n-1)/2 * km * log m).

This Java implementation implements our ASM algorithm. See README file: https://sourceforge.net/projects/asmalgorithm/files/

If you use our ASM implementation to support academic research, please cite the following paper:

Haibin Liu, Lawrence Hunter, Vlado Keselj, and Karin Verspoor. Approximate Subgraph Matching-based Literature Mining for Biomedical Events and Relations. PLOS ONE, 8:4 e60954, 2013.

Project Activity

See All Activity >

Categories

Algorithms

License

BSD License

Follow Approximate Subgraph Matching Algorithm

Approximate Subgraph Matching Algorithm Web Site

Other Useful Business Software
Earn up to 16% annual interest with Nexo. Icon
Earn up to 16% annual interest with Nexo.

Access competitive interest rates on your digital assets.

Generate interest, borrow against your crypto, and trade a range of cryptocurrencies — all in one platform. Geographic restrictions, eligibility, and terms apply.
Get started with Nexo.
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of Approximate Subgraph Matching Algorithm!

Additional Project Details

Intended Audience

Science/Research

Programming Language

Java

Related Categories

Java Algorithms

Registered

2013-03-06