Location of Repository

Maximum common subgraph isomorphism algorithms for the matching of chemical structures

By J.W. Raymond and P. Willett

Abstract

The maximum common subgraph (MCS) problem has become increasingly important in those aspects of chemoinformatics that involve the matching of 2D or 3D chemical structures. This paper provides a classification and a review of the many MCS algorithms, both exact and approximate, that have been described in the literature, and makes recommendations regarding their applicability to typical chemoinformatics tasks.\u

Publisher: Springer Netherlands
Year: 2002
OAI identifier: oai:eprints.whiterose.ac.uk:3569

Suggested articles

Preview


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.