A fragment-based approach to (multiple) MCS Posted on October 22, 2010May 29, 2012 by tripod Maximum common subgraph (MCS) is considered as one of the most challenging problems in combinatorial optimization. As a generalization to (sub-) graph isomorphism, MCS has deep roots within cheminfo... Read More