Tree-structured maximal common subgraph searching. An example of parallel computation with a single sequential processor
- 31 December 1989
- journal article
- Published by Elsevier in Tetrahedron Computer Methodology
- Vol. 2 (3) , 177-202
- https://doi.org/10.1016/0898-5529(89)90046-8
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Artificial intelligence in organic synthesis. SST: starting material selection strategies. An application of superstructure searchJournal of Chemical Information and Computer Sciences, 1984
- Use of a maximum common subgraph algorithm in the automatic identification of ostensible bond changes occurring in chemical reactionsJournal of Chemical Information and Computer Sciences, 1981
- The Automatic Detection of Chemical Reaction SitesJournal of Chemical Information and Computer Sciences, 1978
- Hash Functions for Rapid Storage and Retrieval of Chemical StructuresJournal of Chemical Information and Computer Sciences, 1978
- Stereochemically unique naming algorithmJournal of the American Chemical Society, 1974
- Simulation and evaluation of chemical synthesis. Computer representation and manipulation of stereochemistryJournal of the American Chemical Society, 1974
- A note on the derivation of maximal common subgraphs of two directed or undirected graphsCalcolo, 1973
- Computer analysis of chemical reactions for storage and retrievalJournal of the Chemical Society C: Organic, 1970
- Documentation of Chemical Reactions by Computer Analysis of Structural ChangesJournal of Chemical Documentation, 1967
- Automatic detection of structural similarities among chemical compoundsJournal of the Chemical Society C: Organic, 1967