approximate subgraph matching algorithm

We have hosted the application approximate subgraph matching algorithm in order to run this application in our online workstations with Wine or directly.

Quick description about approximate subgraph matching algorithm:

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.

Audience: Science/Research.

Programming Language: Java.

.