Heuristics for Similarity Searching of Chemical Graphs Using a Maximum Common Edge Subgraph Algorithm
Journal of Chemical Information and Computer Sciences2002Vol. 42(2), pp. 305–316
Citations Over TimeTop 10% of 2002 papers
Abstract
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.
Related Papers
- → A Comparison of Some Measures for the Determination of Inter‐Molecular Structural Similarity Measures of Inter‐Molecular Structural Similarity(1986)202 cited
- → Assessing the ability of chemical similarity measures to discriminate between active and inactive compounds(1996)54 cited
- → Chemical similarity of molecules with physiological response(2022)11 cited
- → Similarity Searching in Databases of Three-Dimensional Chemical Structures(1994)1 cited
- → ASSESSING STRUCTURAL SIMILARITY OF COMPOUNDS WITH PHYSIOLOGICAL RESPONSE: COMPARATIVE STUDY ON SIMILARITY METRICS(2021)