Step-by-Step Calculation of All Maximum Common Substructures through a Constraint Satisfaction Based Algorithm
Journal of Chemical Information and Computer Sciences2003Vol. 44(1), pp. 30–41
Citations Over TimeTop 13% of 2003 papers
Abstract
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.
Related Papers
- → Partial constraint satisfaction(1992)609 cited
- → The complexity of constraint satisfaction revisited(1993)56 cited
- Partial constraint satisfaction(1994)
- → Partial constraint satisfaction(1996)44 cited
- Constraint propagation as an embedded filtering technique for solving constraint satisfaction problems(1991)