Identifying 3D maximal common substructures using transputer networks

Zakharov, 1984, Parallelism and array processing, IEEE Trans. Computers, C-33, 45, 10.1109/TC.1984.5009314 Hwang, 1984 Flynn, 1972, Some computer organizations and their effectiveness, IEEE Trans. Computers, C-21, 948, 10.1109/TC.1972.5009071 Walker, 1985, The Transputer, Byte, 10, 219 Barren, 1986, The Transputer and Occam May, 1984, Occam — an overview, Microprocessors and Microsystems, 8, 73, 10.1016/0141-9331(84)90119-4 Wipke, 1984, Rapid subgraph search using parallelism, J. Chem. Information and Computer Sciences, 24, 255, 10.1021/ci00044a012 Gillet, 1986, Computer storage and retrieval of generic chemical structures in patents. 7. Parallel simulation of a relaxation algorithm for chemical substructure search, J. Chem. Information and Computer Sciences, 26, 118, 10.1021/ci00051a006 Stewart, 1987, Nearest neighbour searching in binary search trees: simulation of a multiprocessor system, J. Documentation, 43, 93, 10.1108/eb026803 Lynch, 1987, The Application of Reconfigurable Microprocessors to Information Retrieval Problems Levi, 1972, A note on the derivation of maximal common subgraphs of two directed or undirected graphs, Calcolo, 9, 341, 10.1007/BF02575586 McGregor, 1981, Use of a maximal common subgraph algorithm in the automatic identification of the ostensible bond changes occurring in chemical reactions, J. Chem. Information and Computer Sciences, 21, 137, 10.1021/ci00031a005 Golender, 1983 Kuhl, 1984, A combinatorial algorithm for calculating ligand binding, J. Computational Chem., 5, 24, 10.1002/jcc.540050105 Crandell, 1983, Computer-assisted examination of compounds for common three-dimensional substructures, J. Chem. Information and Computer Sciences, 23, 186, 10.1021/ci00040a009 Brint, A.T. and Willett, P. Algorithms for the identification of three-dimensional maximal common substructures. J. Chem. Information and Computer Sciences (in press). Shearn, 1982, Division of Economic Studies Brint, 1987, Matching algorithms for handling three-dimensional molecular coordinate data Kung, 1980, The structure of parallel algorithms, Advances in Computers, 19, 65, 10.1016/S0065-2458(08)60033-9