How can parallel algorithms help to find new sequential algorithms?

Paper presented at the American Chemical Society Symposium on Modern Methods of Substructure Searching, Washington, DC, Aug 92. Describes a logical computing model, based on the relaxation method, for chemical substructure searching. A combination of ring perception and labelling is used to create a...

Full description

Saved in:
Bibliographic Details
Published inJournal of chemical information and computer sciences Vol. 33; no. 4; pp. 542 - 544
Main Author Nagy, Zoltan M
Format Journal Article Conference Proceeding
LanguageEnglish
Published Washington, DC American Chemical Society 01.07.1993
Subjects
Chemical substructures
Chemistry
Computerized information storage and retrieval
Exact sciences and technology
General and physical chemistry
General. Nomenclature, chemical documentation, computer chemistry
Searching
Theory of reactions, general kinetics. Catalysis. Nomenclature, chemical documentation, computer chemistry
Parallel algorithm
Molecular structure
Theoretical study
Isomorphism
Substructure
Algorithm
Computer aid
Online AccessGet full text
ISSN0095-2338
1520-5142
DOI10.1021/ci00014a003

Cover

More Information
Summary:Paper presented at the American Chemical Society Symposium on Modern Methods of Substructure Searching, Washington, DC, Aug 92. Describes a logical computing model, based on the relaxation method, for chemical substructure searching. A combination of ring perception and labelling is used to create algorithms for checking isomorphism of molecules and substructure searching. Original abstract-amended.
Bibliography:ark:/67375/TPS-K4LRSXCB-K
istex:BB765E7F89B37DAD3291694FB5BA663FF7405518
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0095-2338
1520-5142
DOI:10.1021/ci00014a003