PhD project work with Sheffield University (Under supervision of Professor Peter Willett and Doctor John Holliday). Variety of Maximum Common Substructure (MCS) algorithms for use with chemical graphs/structures. Coded in Java 1.6.
Please compile using Eclipse IDE (I used Mars.2). Usage examples revolve around the ExtendedIsomorphism
class, in MCSMethodsTest.java
Citing
Please cite the article below when using this code:
Duesbury et al, 2017, Comparison of Maximum Common Subgraph Isomorphism Algorithms for the Alignment of 2D Chemical Structures, ChemMedChem. Available at [http://onlinelibrary.wiley.com/doi/10.1002/cmdc.201700482/abstract]
- Chemistry Development Kit (CDK) 1.5 - molecule handling
- Ambit Core and SMARTS libraries (2.4.13) - fast SMARTS parsing and generation used in MCS representation
- Colt (1.0) - Eigenvector calculations
- Java-getopt (1.0.13) - command line options
- guava (18.0) - alternative list handling
- SMSD (2015 04 01) - additional graph theory tools and MCS handling
Dr Edmund Duesbury (eduece99 AT g mail DOT com)