You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Hello, I'm doing background research for a book and was browsing projects that relate to graph isomorphism. I've interviewed a bunch of computational chemists about this already (e.g., the developers of RDKit), and from that I've come to believe that most uses of graph isomorphism are actually subgraph isomorphism for substructure search and multiple common substructure (MCS).
So I was curious to see the mention of nauty and pynauty in the docs here. However, it's not clear to me what value a chemist might get from counting the automorphisms of a chemical graph. Could someone familiar with this (perhaps who wrote that doc) explain this to me, if it's not too much trouble?
The text was updated successfully, but these errors were encountered:
Hello, I'm doing background research for a book and was browsing projects that relate to graph isomorphism. I've interviewed a bunch of computational chemists about this already (e.g., the developers of RDKit), and from that I've come to believe that most uses of graph isomorphism are actually subgraph isomorphism for substructure search and multiple common substructure (MCS).
So I was curious to see the mention of nauty and pynauty in the docs here. However, it's not clear to me what value a chemist might get from counting the automorphisms of a chemical graph. Could someone familiar with this (perhaps who wrote that doc) explain this to me, if it's not too much trouble?
The text was updated successfully, but these errors were encountered: