Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Step-by-step calculation of all maximum common substructures through a constraint satisfaction based algorithm.

Gonzalo Cerruela García1, Irene Luque Ruiz, Miguel Angel Gómez-Nieto

  • 1Department of Computing and Numerical Analysis, University of Córdoba, Campus Universitario de Rabanales, Building C2, Plant 3, E-14071 Córdoba, Spain.

Journal of Chemical Information and Computer Sciences
|January 27, 2004
PubMed
Summary

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Prototype Selection Method Based on the Rivality and Reliability Indexes for the Improvement of the Classification Models and External Predictions.

Journal of chemical information and modeling·2020
Same author

Building Highly Reliable Quantitative Structure-Activity Relationship Classification Models Using the Rivality Index Neighborhood Algorithm with Feature Selection.

Journal of chemical information and modeling·2020
Same author

Building of Robust and Interpretable QSAR Classification Models by Means of the Rivality Index.

Journal of chemical information and modeling·2019
Same author

A nonparametric weighted feature extraction-based method for c-Jun N-terminal kinase-3 inhibitor prediction.

Journal of molecular graphics & modelling·2019
Same author

Boosted feature selectors: a case study on prediction P-gp inhibitors and substrates.

Journal of computer-aided molecular design·2018
Same author

Study of the Applicability Domain of the QSAR Classification Models by Means of the Rivality and Modelability Indexes.

Molecules (Basel, Switzerland)·2018

This study introduces a novel algorithm for subgraph isomorphism, representing molecular structures as vectors in n-dimensional spaces. This approach efficiently identifies maximum common substructures by solving a constraint satisfaction problem.

Area of Science:

  • Computational chemistry
  • Graph theory
  • Bioinformatics

Background:

  • Subgraph isomorphism is crucial for molecular structure comparison.
  • Existing methods can be computationally intensive.
  • Representing molecules as graphs is a common practice.

Purpose of the Study:

  • To develop a new algorithm for subgraph isomorphism.
  • To efficiently find maximum common substructures.
  • To leverage vector space representations for graph matching.

Main Methods:

  • Representing molecular structures as colored graphs.
  • Mapping these graphs to vectors in n-dimensional spaces.
  • Solving a constraint satisfaction problem in a common m-dimensional space.

Related Experiment Videos

Main Results:

  • The algorithm successfully identifies all maximum common substructures.
  • The vector space approach provides an effective framework for graph matching.
  • The constraint satisfaction problem formulation is key to the solution.

Conclusions:

  • The proposed algorithm offers an efficient method for subgraph isomorphism.
  • Vector space representation is a promising technique for molecular structure analysis.
  • This approach advances the field of computational chemistry and graph theory.