A novel efficient algorithm for determining maximum common subgraphs

Proceedings of the International Conference on Information Visualisation

Volumn 2005, Issue , 2005, Pages 657-663

  Wang, Yu ^a   Maple, Carsten ^a  

^a UNIVERSITY OF BEDFORDSHIRE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DATA REDUCTION; INFORMATION RETRIEVAL; LEARNING SYSTEMS; PATTERN RECOGNITION; VISUALIZATION;

STRUCTURAL INFORMATION; STRUCTURED OBJECTS; SUBGRAPHS;

ALGORITHMS;

EID: 33749050802     PISSN: 10939547     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IV.2005.11     Document Type: Conference Paper

References (13)

1. I. M. Bomze, M. Budinich, P. M. Pardalos, and M. Pelillo, The Maximum Clique Problem, Handbook of Combinatorial Optimization, vol. 4, Kluwer Academy Pub., 1999.
2. Bunke, H., Foggia, P., Guidobaldi, C., Sansone, C., Vento, M., A comparison of algorithms for maximum common subgraph on randomly connected graphs, In Proc. IAPR Workshop on Structural and Syntactic Pattern Recognition, 2002.
3. Cuissart B., Touffet F., Crémilleux B., Hébrard J. J. Relevance of Molecular Similarities Based on the Maximum Common Substructure Health and Medical Informatics Medinfo 01, pp. 16-20, London, UK, September 2001
4. Denis M. Bayada, Richard W.Simpson, and A.Peter Johnson. An algorithm for the multiple common subgraph problem. J. Chem. Inf. Comput. Sci., 32:680-685, 1992
5. P. J. Durand, R. Pasari, J. W. Baker, and Chun-che Tsai, An Efficient Algorithm for Similarity Analysis of Molecules, Internet Journal of Chemistry, vol. 2, 1999.
6. M. R. Garey, D. S. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness", Freeman & Co, New York, 1979.
7. T. R. Hagadone. Molecular substructure similarity searching: Efficient retrieval in two-dimensional structure databases. J.Chem Inf.Comput.Sci, 32:515-521, 1992
8. Novotni, M., Klein, R., 2001, A Geometric Approach to 3D Object Comparison, in proceedings of International Conference on Shape Modeling and Applications, 167-175, 2001.
9. Novotni, M., Klein, R., 2003, 3D Zernike Descriptors for Content Based Shape Retrieval, in proceedings of 8th ACM Symposium on Solid Modeling and Applications 2003.
10. Maple, C., 2003, Geometric Design and Space Planning Using the Marching Squares and Marching Cube Algorithms, Proceedings of the IEEE International Conference on Geometric Modelling and Graphics, GMAG2003.
11. J. J. McGregor, Backtrack Search Algorithms and the Maximal Common Subgraph Problem", Software Practice and Experience, Vol. 12, pp. 23-34, 1982.
12. Takahashi, Y., Satoh, Y., Sasaki, S., Recognition of Largest Common Fragment among a Variety of Chemical Structures. Anal. Sci. 1987, 3, 23-28.
13. Varkony, T.; Shiloach, Y.; Smith, H. Computer - Assisted Examination of Chemical Compounds for Structural Similarities. J. Chem. Inf. Comput. Sci. 1978, 19, 104-111.