Chemical similarity searching using a neural graph matcher

ESANN 2005 Proceedings - 13th European Symposium on Artificial Neural Networks

Volumn , Issue , 2007, Pages 479-484

  Klinger, Stefan ^a   Austin, Jim ^a  

^a Advanced Computer Architectures Group   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CHEMICAL GRAPHS; CHEMICAL SIMILARITY; CORRELATION MATRIX MEMORY; MAXIMUM COMMON SUBGRAPH;

ALGORITHMS;

NEURAL NETWORKS;

EID: 84887001072     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. P. Willet. Chemical similarity searching. J. Chem. Inf. Comput. Sci., 38:983-996, 1998.
2. A.M. Johnson and G.M. Maggiora. Concepts and Applications of Molecular Similarity. Wiley, New York, 1990.
3. R.P. Sheridan. Why do we need so many chemical simiarity search methods? Drug Discovery Today, 7(17):903-911, 2002.
4. J.W. Raymond and P. Willet. Effectiveness of graph-based and fingerprint-based similarity measures? J. of Comput.-Aided Mol. Des., 16:59-71, 2002.
5. A.T. Brint and P. Willet. Algorithms for the identification of three-dimensional maximal common substructures. J. Chem. Inf. Comput. Sci., 27:152-158, 1987.
6. J.W. Raymond, E.J. Gardiner, and P. Willet. Rascal: Calculation of graph similarity using maximum common edge subgraphs. Comput. J., 45:631-644, 2002.
7. H. Barrow and R. Burstall. Subgraph isomorphism, matching relational structures and maximal cliques. Inf. Proc. Lett., 4:83-84, 1976.
8. A. Rosenfeld, R.A. Hummel, and S.W. Zucker. Scene labelling by relaxation operations. IEEE Trans. Systems, Man. and Cybernet., 13:353-362, 1983.
9. D.J. Willshaw, O.P. Buneman, and H.C. Longuet-Higgins. Non-holographic associative memory. Nature, 222:960-962, 1969.
10. C. Bron and J. Kerbosch. Finding all cliques of an undirected graph. Comm. ACM, 16(9):575-577, 1973.
11. D.L. Waltz. Understanding Line Drawings of Scenes with Shadows. McGraw-Hill, New York, 1975.
12. W.J. Christmas, J. Kittler, and M. Petrou. Structural matching in computer vision using probabilistic relaxation. IEEE Trans. Pattern Anal. Machine Intell., 17:353-362, 1995.
13. M. Turner and J. Austin. Graph matching by neural relaxation. Neural Computing and Applications, 7:238-248, 1997.
14. D.P. Casasent and B.A. Telfer. High capacity pattern recoginition associative processors. Neural Networks, 5(4):251-261, 1992.
15. J. Austin. Distributed associative memories for high-speed symbolic reasoning. Fuzzy Sets and Systems, 82:223-233, 1995.
16. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York, 1979.
17. H.S. Wilf. Algorithms and Complexity. Prentice-Hall, New Yersey, 1986.
18. A. Levitin. Introduction to the Design and Analysis of Algorithms. Addison-Wesley, New York, 2003.
19. O.F. Guner. Pharmacophore Perception, Development and Use in Drug Design, page 194. International University Line, La Jolla, CA, USA, 2000.
20. W.D. Wallis, P. Shoubridge, M. Kraetz, and D. Ray. Graph distances using graph union. Pattern Recogn. Lett., 22:701-704, 2001.