I developed software to find a maximum common subgraph (MCS) given a set of molecules represented as a chemical graph. It’s called fmcs. My previous three essays were about the background of the MCS problem, introducing fmcs, and an example of when MCS is used. What I didn’t describe was the mental effort it took to develop this program. This…
See the article here:
Testing hard algorithms