There are a couple of problems in cheminformatics that can be/are solved with graph isomorphism algorithms: maximum common substructure, graph edit distance, et

There are a couple of problems in cheminformatics that can be/are solved with graph isomorphism algorithms: maximum common substructure, graph edit distance, etc., the latter is quite useful to determine molecule similarity but very computationally expensive, especially compared to topological hashing algorithms.