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
Test your software product anywhere in the world Icon
Test your software product anywhere in the world

Get feedback from real people across 190+ countries with the devices, environments, and payment instruments you need for your perfect test.

Global App Testing is a managed pool of freelancers used by Google, Meta, Microsoft, and other world-beating software companies.
Try us today.
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