EnglishFrenchSpanish

Run servers | Ubuntu > | Fedora > |


OnWorks favicon

Approximate Subgraph Matching Algorithm download for Linux

Free download Approximate Subgraph Matching Algorithm Linux app to run online in Ubuntu online, Fedora online or Debian online

This is the Linux app named Approximate Subgraph Matching Algorithm whose latest release can be downloaded as asm-1.0.tar.gz. It can be run online in the free hosting provider OnWorks for workstations.

Download and run online this app named Approximate Subgraph Matching Algorithm with OnWorks for free.

Follow these instructions in order to run this app:

- 1. Downloaded this application in your PC.

- 2. Enter in our file manager https://www.onworks.net/myfiles.php?username=XXXXX with the username that you want.

- 3. Upload this application in such filemanager.

- 4. Start the OnWorks Linux online or Windows online emulator or MACOS online emulator from this website.

- 5. From the OnWorks Linux OS you have just started, goto our file manager https://www.onworks.net/myfiles.php?username=XXXXX with the username that you want.

- 6. Download the application, install it and run it.

Approximate Subgraph Matching Algorithm


Ad


DESCRIPTION

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



This is an application that can also be fetched from https://sourceforge.net/projects/asmalgorithm/. It has been hosted in OnWorks in order to be run online in an easiest way from one of our free Operative Systems.


Ad


Ad