Algorithms for the identification of three-dimensional maximal common substructures

2 algorithms are described for the identification of the maximal substructures common to 2 (or more) 3-dimensional chemical structures, where a substructure consists of a set of atoms and the associated interatomic distances.

Saved in:
Bibliographic Details
Published inJournal of chemical information and computer sciences Vol. 27; no. 4; pp. 152 - 158
Main Authors Brint, Andrew T, Willett, Peter
Format Journal Article
LanguageEnglish
Published American Chemical Society 01.11.1987
Subjects
Chemistry
Computerised information retrieval
Computerized information storage and retrieval
Computerized subject indexing
Information storage and retrieval
Information work
Searching
Structures
Subject indexing
Technical services
Online AccessGet full text
ISSN0095-2338
1520-5142
DOI10.1021/ci00056a002

Cover

More Information
Summary:2 algorithms are described for the identification of the maximal substructures common to 2 (or more) 3-dimensional chemical structures, where a substructure consists of a set of atoms and the associated interatomic distances.
Bibliography:ark:/67375/TPS-NF9SG8FP-R
istex:C4FEEB57A8684AF9250966F0AD0CDAC79B1D1B62
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0095-2338
1520-5142
DOI:10.1021/ci00056a002