Atom-by-atom searching using massive parallelism. Implementation of the Ullmann subgraph isomorphism algorithm on the distributed array processor

Describes the implementation of atom-by-atom searching of chemical structures and substructures using the Ullmann Subgraph Isomorphism Algorithm on the Distributed Array Processor. 00 Original abstract--amended

Saved in:
Bibliographic Details
Published inJournal of chemical information and computer sciences Vol. 31; no. 2; pp. 225 - 233
Main Authors Willett, Peter, Wilson, Terence, Reddaway, Stewart F
Format Journal Article
LanguageEnglish
Published American Chemical Society 01.05.1991
Subjects
Chemistry
Computerised information retrieval
Computerized information storage and retrieval
Computerized subject indexing
Distributed Array Processor
Information storage and retrieval
Information work
Searching
Structures
Subject indexing
Ullmann Subgraph Isomorphism Algorithm
Online AccessGet full text
ISSN0095-2338
1520-5142
DOI10.1021/ci00002a008

Cover

More Information
Summary:Describes the implementation of atom-by-atom searching of chemical structures and substructures using the Ullmann Subgraph Isomorphism Algorithm on the Distributed Array Processor. 00 Original abstract--amended
Bibliography:istex:3E49EC731CCC272726EFF9968558EB3050EC007B
ark:/67375/TPS-54Z9WP5G-K
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0095-2338
1520-5142
DOI:10.1021/ci00002a008