..., 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.