Identifying 3D maximal common substructures using transputer networks
- 31 December 1987
- journal article
- Published by Elsevier in Journal of Molecular Graphics
- Vol. 5 (4) , 200-207
- https://doi.org/10.1016/0263-7855(87)80029-2
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- NEAREST NEIGHBOUR SEARCHING IN BINARY SEARCH TREES: SIMULATION OF A MULTIPROCESSOR SYSTEMJournal of Documentation, 1987
- Computer storage and retrieval of generic chemical structures in patents. 7. Parallel simulation of a relaxation algorithm for chemical substructure searchJournal of Chemical Information and Computer Sciences, 1986
- Rapid subgraph search using parallelismJournal of Chemical Information and Computer Sciences, 1984
- OCCAM-an overviewMicroprocessors and Microsystems, 1984
- A combinatorial algorithm for calculating ligand bindingJournal of Computational Chemistry, 1984
- Parallelism and Array ProcessingIEEE Transactions on Computers, 1984
- Computer-assisted examination of compounds for common three-dimensional substructuresJournal of Chemical Information and Computer Sciences, 1983
- 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
- A note on the derivation of maximal common subgraphs of two directed or undirected graphsCalcolo, 1973
- Some Computer Organizations and Their EffectivenessIEEE Transactions on Computers, 1972