Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:   propose a new algorithm for subgraph isomorphism based on the representation of molecular structures as colored graphs and the representation of these graphs as vectors in n-dimensional spaces. The presented process that obtains all maximum common substructures is based on the solution of a constraint satisfaction problem defined as the common m-dimensional space (m ≤ n) in which the vectors representing the matched graphs can be defined.
['Gonzalo Cerruela García', 'Irene Luque Ruiz', 'Miguel Ángel Gómez-Nieto']
I am writing a research paper on a idea Step-by-step calculation of all maximum common substructures through a constraint satisfaction based algorithm
[{"from": "human", "value": "I am writing a research paper on a idea Step-by-step calculation of all maximum common substructures through a constraint satisfaction based algorithm"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:   propose a new algorithm for subgraph isomorphism based on the representation of molecular structures as colored graphs and the representation of these graphs as vectors in n-dimensional spaces. The presented process that obtains all maximum common substructures is based on the solution of a constraint satisfaction problem defined as the common m-dimensional space (m \u2264 n) in which the vectors representing the matched graphs can be defined."}]