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

On finding nonisomorphic connected subgraphs and distinct molecular substructures.

G Rücker1, C Rücker

  • 1Institut für Organische Chemie und Biochemie, Universität Freiburg, Albertstrasse 21, D-79104 Freiburg, Germany.

Journal of Chemical Information and Computer Sciences
|March 30, 2001
PubMed
Summary

This study introduces a program to identify unique molecular substructures by generating connected subgraphs and eliminating duplicates using graph invariants. While useful for determining the number of distinct substructures (Ns), computational cost limits its application for large molecular graphs.

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

The role of routine SARS-CoV-2 screening of healthcare-workers in acute care hospitals in 2020: a systematic review and meta-analysis.

BMC infectious diseases·2022
Same author

Biopsy-derived oral keratinocytes - A model to potentially test for oral mucosa radiation sensitivity.

Clinical and translational radiation oncology·2022
Same author

Drugs for preventing postoperative nausea and vomiting in adults after general anaesthesia: an abridged Cochrane network meta-analysis.

Anaesthesia·2020
Same author

Impact of investigator initiated trials and industry sponsored trials on medical practice (IMPACT): rationale and study design.

BMC medical research methodology·2020
Same author

Differences in the placebo response between trials do not necessarily preclude network meta-analysis.

Acta psychiatrica Scandinavica·2018
Same author

Influence of experience and qualification on PET-based target volume delineation. When there is no expert--ask your colleague.

Strahlentherapie und Onkologie : Organ der Deutschen Rontgengesellschaft ... [et al]·2014

Area of Science:

  • Graph theory
  • Cheminformatics
  • Computational chemistry

Background:

  • Identifying unique substructures in molecular graphs is crucial for chemical analysis and complexity assessment.
  • Existing methods may not efficiently handle the complexity of diverse molecular structures, including those with unsaturation or heteroatoms.

Purpose of the Study:

  • To develop and present a computational approach for systematically finding all nonisomorphic subgraphs of a given graph.
  • To apply this method to molecular graphs for automatic determination of the number of distinct substructures (Ns).

Main Methods:

  • A computer program is developed to generate all connected subgraphs of a molecular graph.
  • Graph invariants are employed to effectively eliminate duplicate substructures and identify nonisomorphic ones.

Related Experiment Videos

  • The approach is designed for broad applicability to various molecular graph types.
  • Main Results:

    • The program successfully generates all connected subgraphs and identifies unique substructures.
    • The number of distinct substructures (Ns), a measure of molecular complexity and symmetry, can be automatically obtained.
    • The computational effort scales exponentially with the size of the graph.

    Conclusions:

    • The developed program provides a robust method for identifying nonisomorphic subgraphs in molecular structures.
    • The number of distinct substructures (Ns) is a valuable complexity measure, but its computational intensity restricts its use for large molecules.
    • For large-scale analyses, alternative complexity measures may be more practical than Ns due to computational limitations.