For the last couple of months I’ve been working on a new MCS implementation. MCS is short for “Maxium Common Substructure”, and is the cheminformatics term for the maximum common subgraph isomorphism problem. I’ll be posting a set of essays about it, so I’ll start with a background piece. I thought about going into the details of what that…
Read the original here:
MCS background