{"title":"Extension of Ugi's Scheme for Model-Driven Classification of Chemical Reactions","authors":"Shyantani Maiti, Sanjay Ram, Somnath Pal","doi":"10.4018/IJCCE.2015010103","DOIUrl":null,"url":null,"abstract":"The first step to predict the outcome of a chemical reaction is to classify existing chemical reactions, on the basis of which possible outcome of unknown reaction can be predicted. There are two approaches for classification of chemical reactions: Model-Driven and Data-Driven. In model-driven approach, chemical structures are usually stored in a computer as molecular graphs. Such graphs can also be represented as matrices. The most preferred matrix representation to store molecular graph is Bond-Electron matrix BE-matrix. The Reaction matrix R-matrix of a chemical reaction can be obtained from the BE-matrices of educts and products was shown by Ugi and his co-workers. Ugi's Scheme comprises of 30 reaction classes according to which reactions can be classified, but in spite of such reaction classes there were several reactions which could not be classified. About 4000 reactions were studied in this work from The Chemical Thesaurus a chemical reaction database and accordingly 24 new classes have emerged which led to the extension of Ugi's Scheme. An efficient algorithm based on the extended Ugi's scheme have been developed for classification of chemical reactions. Reaction matrices being symmetric, matrix implementation of extended Ugi's scheme using conventional upper/lower tri-angular matrix is of On2 in terms of space complexity. Time complexity of similar matrix implementation is On2 in worst case. The authors' proposed algorithm uses two fixed size look-up tables in a novel way and requires constant space complexity. Worst case time complexity of their algorithm although still On2 but it outperforms conventional matrix implementation when number of atoms or components in the chemical reaction is 4 or more.","PeriodicalId":132974,"journal":{"name":"Int. J. Chemoinformatics Chem. Eng.","volume":"96 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Chemoinformatics Chem. Eng.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/IJCCE.2015010103","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
The first step to predict the outcome of a chemical reaction is to classify existing chemical reactions, on the basis of which possible outcome of unknown reaction can be predicted. There are two approaches for classification of chemical reactions: Model-Driven and Data-Driven. In model-driven approach, chemical structures are usually stored in a computer as molecular graphs. Such graphs can also be represented as matrices. The most preferred matrix representation to store molecular graph is Bond-Electron matrix BE-matrix. The Reaction matrix R-matrix of a chemical reaction can be obtained from the BE-matrices of educts and products was shown by Ugi and his co-workers. Ugi's Scheme comprises of 30 reaction classes according to which reactions can be classified, but in spite of such reaction classes there were several reactions which could not be classified. About 4000 reactions were studied in this work from The Chemical Thesaurus a chemical reaction database and accordingly 24 new classes have emerged which led to the extension of Ugi's Scheme. An efficient algorithm based on the extended Ugi's scheme have been developed for classification of chemical reactions. Reaction matrices being symmetric, matrix implementation of extended Ugi's scheme using conventional upper/lower tri-angular matrix is of On2 in terms of space complexity. Time complexity of similar matrix implementation is On2 in worst case. The authors' proposed algorithm uses two fixed size look-up tables in a novel way and requires constant space complexity. Worst case time complexity of their algorithm although still On2 but it outperforms conventional matrix implementation when number of atoms or components in the chemical reaction is 4 or more.
预测化学反应结果的第一步是对现有的化学反应进行分类,在此基础上预测未知反应的可能结果。化学反应的分类有两种方法:模型驱动和数据驱动。在模型驱动方法中,化学结构通常以分子图的形式存储在计算机中。这样的图也可以表示为矩阵。存储分子图的首选矩阵表示是键-电子矩阵be -矩阵。Ugi和他的同事证明了化学反应的反应矩阵r -矩阵可以由产出物和产物的be矩阵得到。Ugi的方案包括30个反应类别,根据这些反应类别可以对反应进行分类,但尽管有这些反应类别,仍有几个反应无法分类。在这项工作中,研究了化学反应数据库The Chemical Thesaurus中的大约4000个反应,并相应地出现了24个新的类,这导致了Ugi计划的扩展。基于扩展的Ugi方案,提出了一种有效的化学反应分类算法。反应矩阵是对称的,使用常规上下三角矩阵的扩展Ugi方案的矩阵实现在空间复杂度上是On2。在最坏情况下,相似矩阵实现的时间复杂度为On2。作者提出的算法以一种新颖的方式使用两个固定大小的查找表,并且需要恒定的空间复杂度。最坏情况下,他们的算法的时间复杂度虽然仍然是On2,但它优于传统的矩阵实现,当化学反应中的原子或成分的数量是4或更多。