Hi, >I'm very interested to find an open source maximum common substructure >"matcher" - and I was actually planning to look at vflib for the purpose
I'm not familiar with MCS/MCSS, but from what I've read over the weekend, vflib (http://amalfi.dis.unina.it/graph/db/vflib-2.0/doc/vflib.html) does not support this over it's API. igraph (http://igraph.sourceforge.net/documentation.html) has a igraph_larges_cliques() function which, if I understand this correctly, could be used to solve the MCS problem if applied to the modular product graph - or maybe igraph_intersection and igraph_intersection_many can help. A open source MCSS finder is available in Java: http://github.com/asad/VFlib Best Regards Ernst-Georg Schmid ------------------------------------------------------------------------------ Return on Information: Google Enterprise Search pays you back Get the facts. http://p.sf.net/sfu/google-dev2dev _______________________________________________ OpenBabel-discuss mailing list OpenBabel-discuss@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/openbabel-discuss
