An Efficient Algorithm for Automating Classification of Chemical Reactions into Classes in Ugi’s Reaction Scheme: Engineering Book Chapter | IGI Global

×

Receive a 20% Discount on All Purchases Directly Through IGI Global's Online Bookstore

Create a Free IGI Global Library Account to Receive a 25% Discount on All Purchases

Exclusive benefits include one-click shopping, flexible payment options, free COUNTER 4 and MARC records, and a 25% discount on all titles as well as the award-winning InfoSci^{®}-Databases.

InfoSci^{®}-Journals Annual Subscription Price for New Customers: As Low As US$ 4,950

This collection of over 175 e-journals offers unlimited access to highly-cited, forward-thinking content in full-text PDF and XML with no DRM. There are no platform or maintenance fees and a guarantee of no more than 5% increase annually.

Encyclopedia of Information Science and Technology, Fourth Edition (10 Volumes) Extended Offer

Receive the complimentary e-books for the first, second, and third editions with the purchase of the Encyclopedia of Information Science and Technology, Fourth Edition e-book. Plus, take 20% off when purchasing directly through IGI Global's Online Bookstore.

Ram, Sanjay and Somnath Pal. "An Efficient Algorithm for Automating Classification of Chemical Reactions into Classes in Ugi’s Reaction Scheme." Methodologies and Applications for Chemoinformatics and Chemical Engineering. IGI Global, 2013. 285-296. Web. 22 Feb. 2018. doi:10.4018/978-1-4666-4010-8.ch018

APA

Ram, S., & Pal, S. (2013). An Efficient Algorithm for Automating Classification of Chemical Reactions into Classes in Ugi’s Reaction Scheme. In A. Haghi (Ed.), Methodologies and Applications for Chemoinformatics and Chemical Engineering (pp. 285-296). Hershey, PA: IGI Global. doi:10.4018/978-1-4666-4010-8.ch018

Chicago

Ram, Sanjay and Somnath Pal. "An Efficient Algorithm for Automating Classification of Chemical Reactions into Classes in Ugi’s Reaction Scheme." In Methodologies and Applications for Chemoinformatics and Chemical Engineering, ed. A. K. Haghi, 285-296 (2013), accessed February 22, 2018. doi:10.4018/978-1-4666-4010-8.ch018

Download link provided immediately after order completion

$30.00

List Price: $37.50

Current Promotions:

Take 20% Off All Publications Purchased Directly Through the IGI Global Online Bookstore: www.igi-global.com/

Abstract

There are two approaches for classification of chemical reactions: Model-Driven and Data-Driven. In this paper, the authors develop an efficient algorithm based on a model-driven approach developed by Ugi and co-workers for classification of chemical reactions. The authors’ algorithm takes reaction matrix of a chemical reaction as input and generates its appropriate class as output. Reaction matrices being symmetric, matrix implementation of Ugi’s scheme using upper/lower tri-angular matrix is of O(n2) in terms of space complexity. Time complexity of similar matrix implementation is O(n4), both in worst case as well as in average case. The proposed algorithm uses two fixed size look-up tables in a novel way and requires constant space complexity. Time complexity both in worst and average cases of the algorithm is linear.

Among several representations of chemical structures graph theoretic representation (Ivanciuc, 2010; Kier & Hall, 1999; Trinajstic, 1992) is most suitable for obtaining information using model-driven approach. In the following subsections we have discussed such representation and detailed bond-electron matrix and reaction matrix used in this paper under graph theoretic representation.

Graph Theoretic Representation of Molecules and Reactions

Chemical structures are usually stored in a computer as molecular graphs (Beck et al., 1969). A graph is an abstract structure that contains nodes connected by edges. One example of graph that corresponds to chemical structure of ethanal is shown in Figure 1. In such molecular graphs the nodes correspond to the atoms and the edges to the bonds. Such graphs can also be represented as matrices. Their major advantage is that the calculation of paths and cycles can be performed easily by well-known matrix operations. The matrix of a structure with n atoms consists of an array of n × n entries. A molecule with its different atoms and bond types can be represented in matrix form in different ways depending on what kind of entries are chosen for the atoms and bonds. Thus, a variety of matrix representations for chemical compounds are in use (Gasteiger & Engel, 2003): adjacency (Ivanciuc, 2000; Markovic et al., 2001), distance (Ivanciuc & Ivanciuc, 1999; Mihalic et al., 1992), incidence, bond, and bond-electron matrices. Among these representations bond-electron matrix representation provides all information given by bond matrix and additionally number of free electrons of an atom. In this work we have used BE-matrix, the representation of which is explained in the following.

Figure 1.

Ethanal can be represented in graph theory as a labelled graph