Display Settings:

Format

Send to:

Choose Destination
We are sorry, but NCBI web applications do not support your browser and may not function properly. More information
J Chem Inf Comput Sci. 2002 Mar-Apr;42(2):305-16.

Heuristics for similarity searching of chemical graphs using a maximum common edge subgraph algorithm.

Author information

  • 1Pfizer Global Research and Development, Ann Arbor Laboratories, Michigan 48105, USA.

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.

PMID:
11911700
[PubMed]
PubMed Commons home

PubMed Commons

0 comments
How to join PubMed Commons

    Supplemental Content

    Full text links

    Icon for American Chemical Society
    Loading ...
    Write to the Help Desk