Topological Index Calculator III

Slides:



Advertisements
Similar presentations
Chapter 8 Topics in Graph Theory
Advertisements

Graph-02.
Convex drawing chapter 5 Ingeborg Groeneweg. Summery What is convex drawing What is convex drawing Some definitions Some definitions Testing convexity.
13 May 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
Substructures and Patterns in 2-D Chemical Space Danail Bonchev Department of Mathematics and Applied Mathematics and Center for the Study of Biological.
IKI 10100: Data Structures & Algorithms Ruli Manurung (acknowledgments to Denny & Ade Azurat) 1 Fasilkom UI Ruli Manurung (Fasilkom UI)IKI10100: Lecture10.
3.3 Spanning Trees Tucker, Applied Combinatorics, Section 3.3, by Patti Bodkin and Tamsen Hunter.
Edited by Malak Abdullah Jordan University of Science and Technology Data Structures Using C++ 2E Chapter 12 Graphs.
Mining Graphs.
GOLOMB RULERS AND GRACEFUL GRAPHS
Applications of graph traversals
Cheminformatics II Apr 2010 Postgrad course on Comp Chem Noel M. O’Boyle.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Spring, 2001 Makeup Lecture Chapter 23: Graph Algorithms Depth-First SearchBreadth-First.
Connected Components, Directed Graphs, Topological Sort COMP171.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2001 Wednesday, 9/26/01 Graph Basics.
Representing Graphs Wade Trappe. Lecture Overview Introduction Some Terminology –Paths Adjacency Matrix.
Chapter 9 Graph algorithms Lec 21 Dec 1, Sample Graph Problems Path problems. Connectedness problems. Spanning tree problems.
Connected Components, Directed Graphs, Topological Sort Lecture 25 COMP171 Fall 2006.
Applied Discrete Mathematics Week 12: Trees
Chapter 9: Graphs Basic Concepts
Discrete Mathematics Lecture 9 Alexander Bukharovich New York University.
Graph theory as a method of improving chemistry and mathematics curricula Franka M. Brückler, Dept. of Mathematics, University of Zagreb (Croatia) Vladimir.
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley. All rights reserved.
Molecular Descriptors
Google’s Billion Dollar Eigenvector Gerald Kruse, PhD. John ‘54 and Irene ‘58 Dale Professor of MA, CS and I T Interim Assistant Provost Juniata.
Copyright © Cengage Learning. All rights reserved.
Graph Theory Topics to be covered:
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
“Topological Index Calculator” A JavaScript application to introduce quantitative structure-property relationships (QSPR) in undergraduate organic chemistry.
7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.
Module 5 – Networks and Decision Mathematics Chapter 23 – Undirected Graphs.
Week 11 - Wednesday.  What did we talk about last time?  Graphs  Euler paths and tours.
IUPAC Nomenclature Organic Compounds (Part 1) of.
CSCI 115 Chapter 7 Trees. CSCI 115 §7.1 Trees §7.1 – Trees TREE –Let T be a relation on a set A. T is a tree if there exists a vertex v 0 in A s.t. there.
 2. Region(face) colourings  Definitions 46: A edge of the graph is called a bridge, if the edge is not in any circuit. A connected planar graph is called.
1 Cheminformatics David Shiuan Department of Life Science and Institute of Biotechnology National Dong Hwa University.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Exit Slip 1.How are the lessons? – Too fast? long? slow? Boring? How are you finding the pace of the course? Difficult? Easy? Challenging? 3. What.
Dale Roberts Department of Computer and Information Science, School of Science, IUPUI CSCI 240 Recursion and Trees Dale Roberts, Lecturer
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Ver Chapter 13: Graphs Data Abstraction & Problem Solving with C++
Chapter 10: Trees A tree is a connected simple undirected graph with no simple circuits. Properties: There is a unique simple path between any 2 of its.
Chemistry is a Physical Science.  Chemistry is the study of the composition, structure, and properties of matter, the processes that matter undergoes,
Roberto Todeschini Viviana Consonni Manuela Pavan Andrea Mauri Davide Ballabio Alberto Manganaro chemometrics molecular descriptors QSAR multicriteria.
Chapter 11 - Graph CSNB 143 Discrete Mathematical Structures.
Chapter 11. Chapter Summary  Introduction to trees (11.1)  Application of trees (11.2)  Tree traversal (11.3)  Spanning trees (11.4)
Senior Project Board Implementation of the Solution to the Conjugacy Problem in Thompson’s Group F by Nabil Hossain Advisers: James Belk & Robert McGrail.
Chapter 11. Chapter Summary Introduction to Trees Applications of Trees (not currently included in overheads) Tree Traversal Spanning Trees Minimum Spanning.
Graph Terms By Susan Ott. Vertices Here are 7 vertices without any edges Each Vertex is labeled a different color and number.
CS 361 – Chapter 13 Graph Review Purpose Representation Traversal Comparison with tree.
Lecture 20. Graphs and network models 1. Recap Binary search tree is a special binary tree which is designed to make the search of elements or keys in.
1 Graph theory Outline A graph is an abstract data type for storing adjacency relations –We start with definitions: Vertices, edges, degree and sub-graphs.
Trees.
Discrete Mathematics Graph: Planar Graph Yuan Luo
Chapter 3. Decompositions of Graphs
Computers versus human brains a cooperative game for scientific discoveries Alain Hertz Polytechnique Montréal Mons, August 23, 2017.
Minimum Spanning Tree 8/7/2018 4:26 AM
Graph theory Definitions Trees, cycles, directed graphs.
12. Graphs and Trees 2 Summary
Lecture 18. Basics and types of Trees
Graph Search Applications
Daylight and Discovery
Graphs Chapter 13.
Section 1 Chemistry Is a Physical Science
Chapter 9: Graphs Basic Concepts
Nomenclature of Cyclo Hydrocarbons
Subscript and Summation Notation
A Introduction to Computing II Lecture 13: Trees
Chapter 16 1 – Graphs Graph Categories Strong Components
Chapter 9: Graphs Basic Concepts
GRAPHS.
Presentation transcript:

Topological Index Calculator III [1] Computation of the Hosoya Index using SMILES representation Steven D. Granz, Departments of Mathematics & Computer Science, Gordon College, Wenham, MA 01984, sgranz@peace.gordon.edu Irvin J. Levy, Departments of Chemistry & Computer Science, Gordon College, ijl@gordon.edu Hosoya Index Regression: Abstract: Hosoya Index Algorithm Using SMILES Representation: Z(CC(C)) Number of parent carbons: 2 N = 2 / 2 = 1 N = 1 + 1 = 2 C | C(C) Z(CC(C)) = Z(C) * Z(C(C)) + PI Z(fragments) PI Z(fragments) = = Z(CC(C)) = Z(C) * Z(C(C)) + Z((C)) = 1 * 2 + 1 = 3 Z(C(C)CC) Number of parent carbons: 3 N = 3 / 2 = 1.5 N = 1 N = 1 + 1 = 2 C(C) | CC Z(C(C)CC) = Z(C(C)) * Z(CC) + PI Z(fragments) PI Z(fragments) = = = Z(C(C)) * Z(CC) + Z((C)) * Z(C) = 2 * 2 + 1 * 1 = 5 Z(G) = Z(CC(C)) * Z(C(C)CC) + Z((C)) * Z((C)) * Z(C) * Z(CC) = 3 * 5 + 1 * 1 * 1 * 2 = 17 Previously we introduced Topological Index Calculator as a freely available JavaScript application for the computation of QSPR descriptor indices for alkane molecules. The previous program supported the computation of the following indices: Balaban Index, Weiner Index, Randic Index, Odd-Even Index, Polarity Index, Vertex Degree Distance Index and Harary Index. We now report the addition of the Hosoya Index for acyclic alkanes. Further, we discuss the algorithm we have developed to compute the Hosoya Index directly from the SMILES representation of the molecule and how to compute the Hosoya Index for cyclic alkanes. Computing the value of the Hosoya Index by hand can be tedious. As the number of bonds in the molecule increases, the probability of human error becomes greater. Without a computational tool such as Topological Index Calculator, human error is very likely to occur. In the process of extending Topological Index Calculator, we developed an algorithm that uses SMILES representation to compute the Hosoya Index. SMILES Representation Summary: SMILES [3] (Simplified Molecular Input Line Entry Specification) is a simple yet comprehensive chemical nomenclature. SMILES is used for expressing the molecular graph of "normal" organic molecules. Two Basic Rules of SMILES: Carbons are represented by the atomic symbol: C Branching is indicated by parentheses Hosoya Index Algorithm For Acyclic Alkanes: Given G is the SMILES representation of an acyclic alkane, Z(G) is computed as follows: Find the number of carbons in G If the number of carbons = 1 Z(G) = 1 Else if the number of carbons = 2 Z(G) = 2 Else if the number of carbons = 3 Z(G) = 3 Else Find the number of parent carbons in G Let N = (the number of parent carbon) / 2 If the number of parent carbon is odd truncate N to an integer Add one to N Find the Nth carbon in G Let the atom, B, be the Nth parent carbon atom in G’s SMILES representation Z(G) = Z(subgraph, left of B) * Z(subgraph, from B to end) + PI Z(fragments) where PI Z(fragments) is equal to the product of Z for each fragment created by removing B and the parent carbon to the left of B Hosoya Index Algorithm for Cyclic Alkanes: Given G is the graph representation of a cyclic alkane, Z(G) can be computed by finding the Hosoya Index of two other alkanes for which the sum of their individual Z values will equal Z(G). Preferably, we wish to find two alkanes that are acyclic, but if that is not the case then we can again find the Hosoya Index of two other alkanes, recursively continuing until we have a sum of the Hosoya Index of all acyclic alkanes, yielding the Hosoya Index for the original cyclic structure. An algorithm to do this is the following: 1. Let H be a subgraph defined by removal of one random edge, E, from a ring in G 2. Let I be a subgraph defined by removal of E from G as well as by the removal of all edges adjacent to E in G 3. If H or I is a disconnected graph then calculate Z(H) and/or Z(I) as the product of Z for each of the connected components of the disconnected graph(s) 4. Z(G) = Z(H) + Z(I) http://www.math-cs.gordon.edu/courses/organic/topo/ Hosoya Index: The Hosoya Index [2], Z = Z(G), was introduced by Hosoya in 1971 as the Z index. This index is defined below: where p(G;i) is the number of selections of i mutually non-adjacent edges in G , a chemical graph with N vertices. By definition, p(G;0) = 1, and p(G;1) is the number of edges in G. Example: 2,3-dimethylpentane p(G;0) = 1 p(G;1) = 6 p(G;2) = 8 p(G;3) = 2 The Hosoya Index of 2,3-dimethylpentane Z(G) = p(G;0) + p(G;1) + p(G;2) + p(G;3) = 1 + 6 + 8 + 2 = 17 Acyclic Alkane Example: 2,3-dimethylpentane SMILES Representation: G = CC(C)C(C)CC Z(G) Number of parent carbons: 5 N = 5 / 2 = 2.5 N = 2 N = 2 +1 = 3 CC(C) | C(C)CC Z(G) = Z(CC(C)) * Z(C(C)CC) + PI Z(fragments) PI Z(fragments) = = Z(G) = Z(CC(C)) * Z(C(C)CC) + Z((C)) * Z((C)) * Z(C) * Z(CC) Future Directions: • Students use the tool to verify values found in the literature since at least two journal articles [4] [5] have been found to have errors. • Incorporate existing indices into Topological Index Calculator • Develop new indices with better predictions of the boiling point Cyclic Alkane Example: 1,2-cyclopropane Z(G) = Z( ) + Z( ) Z(G) = Z(CC(C)CC) + Z(CC) * Z(C) * Z(C) * Z(C) Z(CC(C)CC) = Z(CC(C)) * Z(CC) + PI Z(fragments) = Z(CC(C)) * Z(CC) + Z(C) * Z((C)) * Z(C) = 3 * 2 + 1 * 1 * 1 = 7 = 7 + 2 * 1 * 1 * 1 = 9 References: [1] Topological Index Calculator II: Applications for the classroom and research, Steven D. Granz and I. J. Levy, 228th ACS national meeting, Philadelphia, PA 2004. [2] Mihalic, Z. "A Graph-Theoretical Approach to Structure-Property Relationships.” J. Chem. Educ. 1992, 69, 701-712. [3] Weininger, D. “SMILES, a Chemical Language and Information System.” J. Chem. Inf. Comput. Sci. 1988, 28, 31-26. [4] Cao, C. "Topological Indices Based on Vertex, Distance and Ring: On Boiling Points of Paraffins and Cycloalkanes." J. Chem. Inf. and Comp. Sci., 2001, 41, 867-877. [5] Mihalic, Z., et al. “The Detour Matrix And The Detour Index.” Topological Indices and Related Descriptors in QSAR and QSPR. Ed. J. Devillers and A. T. Balaban. Gordon and Breach Science Publishers, 1999, pp.297- 299.