Step-by-Step Calculation of All Maximum Common Substructures through a Constraint Satisfaction Based Algorithm

In this paper we propose a new algorithm for subgraph isomorphism based on the representation of molecular structures as colored graphs and the representation of these graphs as vectors in n-dimensional spaces. The presented process that obtains all maximum common substructures is based on the solution of a constraint satisfaction problem defined as the common m-dimensional space (m< or =n) in which the vectors representing the matched graphs can be defined.

[1]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[2]  William J. Christmas,et al.  Structural Matching in Computer Vision Using Probabilistic Relaxation , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  J. J. McGregor,et al.  Backtrack search algorithms and the maximal common subgraph problem , 1982, Softw. Pract. Exp..

[4]  David Eppstein,et al.  The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems , 1994, GD.

[5]  Radu Horaud,et al.  Symbolic image matching by simulated annealing , 1990, BMVC.

[6]  S. Basak,et al.  Prediction of the dermal penetration of polycyclic aromatic hydrocarbons (PAHs): a hierarchical QSAR approach. , 1999, SAR and QSAR in environmental research.

[7]  William Lingran Chen,et al.  MCSS: a new algorithm for perception of maximal common substructures and its application to NMR spectral studies. 2. Applications , 1992, J. Chem. Inf. Comput. Sci..

[8]  Javier Larrosa,et al.  Graph Pattern Matching using Constraint Satisfaction , 2001 .

[9]  A new algorithm to obtain all maximum common subgraphs in molecular graphs using binary arithmethic and constraints satisfaction model , 2003 .

[10]  Horst Bunke,et al.  A Comparison of Algorithms for Maximum Common Subgraph on Randomly Connected Graphs , 2002, SSPR/SPR.

[11]  John M. Barnard,et al.  Chemical Similarity Searching , 1998, J. Chem. Inf. Comput. Sci..

[12]  Petar D. Simic.  Constrained Nets for Graph Matching and Other Quadratic Assignment Problems , 1991, Neural Comput..

[13]  Julian R. Ullmann,et al.  An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[14]  Jordi Cortadella,et al.  A Relational View of Subgraph Isomorphism , 2000, RelMiCS.

[15]  Horst Bunke,et al.  Efficient Subgraph Isomorphism Detection: A Decomposition Approach , 2000, IEEE Trans. Knowl. Data Eng..

[16]  K. Taylor-McCabe,et al.  QSAR studies of antiviral agents using molecular similarity analysis and structure-activity maps. , 1999, SAR and QSAR in environmental research.

[17]  Peter Willett,et al.  Heuristics for Similarity Searching of Chemical Graphs Using a Maximum Common Edge Subgraph Algorithm , 2002, J. Chem. Inf. Comput. Sci..