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

Focus on Business Growth with a VoIP Solution Focus on Business Growth with a VoIP Solution Icon
Focus on Business Growth with a VoIP Solution Icon

Cloud Phone Service. Built for Business.

  • Over 50 business-class features
  • Easy setup. Professional installation.
  • CRM integration

Rate This Project

Login To Rate This Project

User Ratings

★★★★★
★★★★
★★★
★★
0
0
0
0
0
ease 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 0 / 5
features 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 0 / 5
design 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 0 / 5
support 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 0 / 5

User Reviews

There are no 5 star reviews.

Additional Project Details

Intended Audience

Science/Research

Programming Language

Java

Registered

2012-08-09