EMCSS: A New Method for Maximal Common Substructure Search

This paper describes a new method-EMCSS for Maximal Common Substructure (MCS) search, which uses a substructure searching algorithm: Xu's GMA algorithm converts the MCS search space into a much smaller space, the connection table space of query graph (QG), and adopts a evolutionary strategy to search the optimum solution. The principle of the EMCSS method and its implementation are described in detail. Some highly complex examples, even a hyperstructure pair, are tested. The investigation demonstrates that the EMCSS method is robust and efficient.