The subgraph matching problem (subgraph isomorphism) is NP-complete. We designed a simple exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach. The total worst-case algorithm complexity is O(n^2 * k^n) where n is the number of vertices and k is the vertex degree.

We have demonstrated the successful usage of our algorithm in three biomedical relation and event extraction applications: BioNLP 2011 shared tasks on event extraction, Protein-Residue association detection and Protein-Protein interaction identification.

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

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

Haibin Liu, Vlado Keselj, and Christian Blouin. Exploring a Subgraph Matching Approach for Extracting Biological Events from Literature. Computational Intelligence, 2013.

Project Activity

See All Activity >

Categories

Algorithms

License

BSD License

Follow Exact Subgraph Matching Algorithm

Exact Subgraph Matching Algorithm Web Site

Other Useful Business Software
Resco toolkit for building mobile apps Icon
Resco toolkit for building mobile apps

A no-code toolkit for building responsive and resilient mobile business applications for Microsoft Power Platform, Dynamics 365, Dataverse and Salesfo

Deploying mobile apps with Resco takes days, not months—all without writing a single line of code. Workers can download the Resco app from AppStore, Google Play, or Windows Store, log into your company environment, and instantly use the app you have published on any device.
Learn More
Rate This Project
Login To Rate This Project

User Reviews

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

Additional Project Details

Intended Audience

Science/Research

Programming Language

Java

Related Categories

Java Algorithms

Registered

2012-08-09
Report inappropriate content