RASCAL: calculation of graph similarity using maximum common edge subgraphs

Article English OPEN
Raymond, J.W.; Gardiner, E.J.; Willett, P.;
(2002)
  • Publisher: Oxford University Press
  • Subject:
    acm: MathematicsofComputing_DISCRETEMATHEMATICS

A new graph similarity calculation procedure is introduced for comparing labeled graphs. Given a minimum similarity threshold, the procedure consists of an initial screening process to determine whether it is possible for the measure of similarity between the two graphs... View more
  • References (2)

    Raymond, J., Gardiner, E. and Willett, P. (2002) Heuristics for rapid similarity searching of chemical graphs using a maximum common edge subgraph algorithm. J. Chem. Inf. Comput. Sci., 42, 305-316.

    Willett, P., Barnard, J. and Downs, G. (1998) Chemical similarity searching. J. Chem. Inf. Comput. Sci., 38, 983-996.

  • Metrics
Share - Bookmark