Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Search research articles

Related Experiment Videos

Rapid subgraph search using parallelism.

W T Wipke, D Rogers

Journal of Chemical Information and Computer Sciences

|November 1, 1984

Summary

This summary is machine-generated.

A novel parallel processing algorithm enhances subgraph matching efficiency. This new approach achieves significant speedups for chemical substructure searches, improving computational performance.

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

Supercomputer-Based Ensemble Docking Drug Discovery Pipeline with Application to Covid-19.

ChemRxiv : the preprint server for chemistry·2020

Same author

Sci-Thur PM: YIS - 07: Monte Carlo simulations to obtain several parameters required for electron beam dosimetry.

Medical physics·2017

Same author

Sci-Thur PM: YIS - 02: A validated approach for clinical linacs to accurately determine the photon spectra and the incident electron energy.

Medical physics·2017

Same author

SU-E-T-482: A More Accurate Bare <sup>12</sup> 5I Spectrum.

Medical physics·2017

Same author

WE-E-218-01: Writing and Reviewing Papers in Medical Physics.

Medical physics·2017

Same author

Asymmetrical competition between the bell miner (Manorina melanophrys, Meliphagidae) and other honeyeaters: evidence from Southeastern Victoria, Australia.

Oecologia·2017

Same journal

Future Papers.

Journal of chemical information and computer sciences·2016

Same journal

Future Papers.

Journal of chemical information and computer sciences·2016

Same journal

Future Papers.

Journal of chemical information and computer sciences·2016

Same journal

Future Papers.

Journal of chemical information and computer sciences·2016

Same journal

Future Papers.

Journal of chemical information and computer sciences·2016

Same journal

Future Papers.

Journal of chemical information and computer sciences·2016

See all related articles

Area of Science:

Computer Science
Computational Chemistry
Algorithm Development

Background:

Subgraph matching is crucial for chemical substructure searches.
Existing algorithms often lack efficient parallel processing capabilities.
Node-by-node matching presents a challenge for parallelization.

Purpose of the Study:

To introduce a new parallel processing algorithm for subgraph matching.
To enable parallelism within the node-by-node matching process.
To evaluate the algorithm's performance in chemical substructure searches.

Main Methods:

Developed a novel parallel processing algorithm for subgraph matching.
Implemented a SIMULA program to simulate the parallel subgraph search.

Related Experiment Videos

Conducted simulations on a 25-processor machine using chemical substructure search problems.

Main Results:

Achieved an average processor utilization of 84%.
Demonstrated up to a 24-fold speed enhancement compared to single-processor execution.
Successfully applied the algorithm to chemical substructure search problems.

Conclusions:

The new parallel algorithm significantly improves subgraph matching efficiency.
The approach offers substantial speed enhancements for computational chemistry tasks.
Potential applications include starting material selection and general substructure analysis.