asad / VFLib
- Source
- Commits
- Network (2)
- Issues (0)
- Downloads (0)
- Wiki (1)
- Graphs
-
Tree:
541cb2b
VFLib /
| name | age | message | |
|---|---|---|---|
| |
LICENSE.txt | ||
| |
README | ||
| |
build.xml | ||
| |
dist/ | ||
| |
lib/ | ||
| |
manifest.mf | ||
| |
nbproject/ | ||
| |
src/ |
README
**************************************************************** VFLib code can be used to find/perform Maximum Common Subgraph (MCS) or Substructure searches based on Graph (Sub)-Isomorphism. **************************************************************** The algorithm is described in Cordella, L.P.; Foggia, P.; Sansone, C.; Vento, M. "A (sub)graph isomorphism algorithm for matching large graphs" Pattern Analysis and Machine Intelligence, IEEE Transactions on Volume 26, Issue 10, Oct. 2004 Page(s):1367 - 1372 The original code was taken from http://metamolecular.com/mx and modified by Syed Asad Rahman (asad@ebi.ac.uk) This code requires the Chemistry Development Kit (CDK http://cdk.git.sourceforge.net ) . The present code is part of the Small Molecule Subgraph Detector (SMSD http://www.ebi.ac.uk/thornton-srv/software/SMSD ) library. If you use this software please <b>cite the paper and the (SMSD) URL</b> S. A. Rahman, M. Bashton, G. L. Holliday, R. Schrader and J. M. Thornton, Small Molecule Subgraph Detector (SMSD) toolkit, Journal of Cheminformatics 2009, 1:12. DOI:10.1186/1758-2946-1-12 Wish you a happy coding! Name: Syed Asad Rahman Contact: asad@ebi.ac.uk

