| Literature DB >> 12510884 |
John W Raymond1, Peter 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.Entities:
Mesh:
Year: 2002 PMID: 12510884 DOI: 10.1023/a:1021271615909
Source DB: PubMed Journal: J Comput Aided Mol Des ISSN: 0920-654X Impact factor: 3.686