title: Step-by-step calculation of all maximum common substructures through a constraint satisfaction based algorithm.
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.
authors.affiliation: Department of Computing and Numerical Analysis, University of Córdoba, Campus Universitario de Rabanales, Building C2, Plant 3, E-14071 Córdoba, Spain.
authors.forename: Gonzalo
authors.initials: G
authors.lastname: Cerruela García
authors.forename: Irene
authors.initials: I
authors.lastname: Luque Ruiz
authors.forename: Miguel Angel
authors.initials: MA
authors.lastname: Gómez-Nieto