Answers are grounded in this paper and cite their sources.
Recently a method (RASCAL) for determining graph similarity using a maximum common edge subgraph algorithm has been proposed which has proven to be very efficient when used to calculate the relative similarity of chemical structures represented as graphs. This paper describes heuristics which simplify a RASCAL similarity calculation by taking advantage of certain properties specific to chemical graph representations of molecular structure. These heuristics are shown experimentally to increase the efficiency of the algorithm, especially at more distant values of chemical graph similarity.
No takes yet. Share an insight, caveat, or question.
Raymond et al. (2002) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: