Abstract
Screening a library of molecular graphs for an exact or approximate match with one particular molecular graph, the query graph, is reduced to list comparisons. The lists contain lengths of shortest paths ingraph Voronoi regions. This induces the notion of shortest path similarity. All graphs that are shortest path similar to the query graph are efficiently retrievable. The same applies to approximate or similarity matching. For the retrieval of all superstructures of a query, shortest path lists are modified to distance patterns. This alsoallows algorithmic support for query construction.
Keywords: graph voronoi regions, isomorphism, retrieval, screening
Related Journals
Anti-Cancer Agents in Medicinal Chemistry
Anti-Inflammatory & Anti-Allergy Agents in Medicinal Chemistry
Current Analytical Chemistry
Current Computer-Aided Drug Design
Current Bioactive Compounds
Current Cancer Drug Targets
Current Cancer Therapy Reviews
Current Diabetes Reviews
Current Drug Safety
Current Drug Targets
Related Books
2-Deoxy-D-Glucose: Chemistry and Biology
Chiral Ionic Liquids: Applications in Chemistry and Technology
Anthocyanins: Pharmacology and Nutraceutical Importance
Therapeutic Insights into Herbal Medicine through the Use of Phytomolecules
The Roles and Responsibilities of Clinical Pharmacists in Hospital Settings
Bioactive Compounds from Medicinal Plants for Cancer Therapy and Chemoprevention
Biochar - Solid Carbon for Sustainable Agriculture
DFT-Based Studies On Atomic Clusters
Basics of Organic Chemistry: A Textbook for Undergraduate Students
Science of Spices and Culinary Herbs - Latest Laboratory, Pre-clinical, and Clinical Studies
7