SECS (Simulation and Evaluation of Chemical Synthesis) is a retrosynthetic organic synthesis design program. Building a large knowledge base is required in order to solve important synthesis problems in industry. We developed a method that automatically builds a large ALCHEM transform library. Fifteen thousand reactions have been built. These were modified and reorganized into a form usable by SECS. At the same time, we added an additional strategy generation function to the SECS strategy module. We present our method and an example of a SECS analysis of a target molecule using our large ALCHEM knowledge base.
SECS (Simulation and Evaluation of Chemical Synthesis)是一个反合成有机合成设计程序。为了解决工业中重要的合成问题,需要建立一个庞大的知识库。我们开发了一种自动构建大型ALCHEM转换库的方法。已经建立了15000个反应。这些被修改和重组成SECS可用的形式。同时,我们在SECS策略模块中增加了额外的策略生成功能。我们提出了我们的方法和一个使用我们的大型ALCHEM知识库对目标分子进行SECS分析的例子。
{"title":"Automatic knowledge base building for the organic synthesis design program (SECS)","authors":"Mikiro Yanaka , Kazuhiko Nakamura , Azusa Kurumisawa , W. Todd Wipke ∗","doi":"10.1016/0898-5529(90)90062-D","DOIUrl":"10.1016/0898-5529(90)90062-D","url":null,"abstract":"<div><p>SECS (Simulation and Evaluation of Chemical Synthesis) is a retrosynthetic organic synthesis design program. Building a large knowledge base is required in order to solve important synthesis problems in industry. We developed a method that automatically builds a large ALCHEM transform library. Fifteen thousand reactions have been built. These were modified and reorganized into a form usable by SECS. At the same time, we added an additional strategy generation function to the SECS strategy module. We present our method and an example of a SECS analysis of a target molecule using our large ALCHEM knowledge base.</p></div>","PeriodicalId":101214,"journal":{"name":"Tetrahedron Computer Methodology","volume":"3 6","pages":"Pages 359-375"},"PeriodicalIF":0.0,"publicationDate":"1990-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0898-5529(90)90062-D","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79676470","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A computer system for rational molecular design is described. The system, named as ANALOGS, provides the triangular elements consisting of functional atoms for the comparison of a number of stereochemically different compounds. Application of the system for aldose reductase inhibitors is described. The results obtained give some interesting information on the inhibitor-binding site of aldose reductase and on the structural features of the inhibitors.
{"title":"A method to detect common features necessary for biological activity: Application of ANALOGS for aldose reductase inhibitors","authors":"Tamio Yasukawa ∗ , Katsunori Satoh , Noriaki Gotoh , Toshimasa Ishida ∗ , Shiegeuki Sumiya , Kunihiro Kitamura ∗","doi":"10.1016/0898-5529(90)90116-P","DOIUrl":"10.1016/0898-5529(90)90116-P","url":null,"abstract":"<div><p>A computer system for rational molecular design is described. The system, named as ANALOGS, provides the triangular elements consisting of functional atoms for the comparison of a number of stereochemically different compounds. Application of the system for aldose reductase inhibitors is described. The results obtained give some interesting information on the inhibitor-binding site of aldose reductase and on the structural features of the inhibitors.</p></div>","PeriodicalId":101214,"journal":{"name":"Tetrahedron Computer Methodology","volume":"3 1","pages":"Pages 3-10, IN1-IN2, 11-14"},"PeriodicalIF":0.0,"publicationDate":"1990-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0898-5529(90)90116-P","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72548478","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1990-01-01DOI: 10.1016/0898-5529(90)90104-G
Raúl E. Valdés-Pérez
This paper overviews the design and current status of the mechem system of programs, which automates partially the elucidation of chemical reaction pathways of up to moderate complexity. The system addresses most aspects of pathway elucidation, with special attention to the formation of initial hypotheses. No chemical databases are used; the sources of power instead are first, novel algorithms for reasoning about pathways, and second, experimental data on the reaction to be studied. The performance of the system is illustrated on data from the liquid-phase oxidation of propane. Some by-products of the system design have contributed to chemistry knowledge. The file mechem.lsp is included on disk in this issue as a sample of the lisp functions used in mechem.
{"title":"Symbolic computing on reaction pathways","authors":"Raúl E. Valdés-Pérez","doi":"10.1016/0898-5529(90)90104-G","DOIUrl":"10.1016/0898-5529(90)90104-G","url":null,"abstract":"<div><p>This paper overviews the design and current status of the <em><span>mechem</span></em> system of programs, which automates partially the elucidation of chemical reaction pathways of up to moderate complexity. The system addresses most aspects of pathway elucidation, with special attention to the formation of initial hypotheses. No chemical databases are used; the sources of power instead are first, novel algorithms for reasoning about pathways, and second, experimental data on the reaction to be studied. The performance of the system is illustrated on data from the liquid-phase oxidation of propane. Some by-products of the system design have contributed to chemistry knowledge. The file <em><span>mechem.lsp</span></em> is included on disk in this issue as a sample of the <em><span>lisp</span></em> functions used in <em><span>mechem</span></em>.</p></div>","PeriodicalId":101214,"journal":{"name":"Tetrahedron Computer Methodology","volume":"3 5","pages":"Pages 277-285"},"PeriodicalIF":0.0,"publicationDate":"1990-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0898-5529(90)90104-G","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87407172","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1990-01-01DOI: 10.1016/0898-5529(90)90061-C
Christian Tonnelier, Philippe Jauffret ∗, Thierry Hanser, Gérard Kaufmann
In the context of automatic knowledge acquisition for computer-assisted synthesis planning, this paper presents an efficient algorithm for the identification of the maximal common substructures between reaction graphs. The terms of the problem are first completely specified. Then, the method used to solve it is presented and developed step by step. The formal algorithm is proposed as an appendix.
{"title":"Machine learning of generic reactions: 3. an efficient algorithm for maximal common substructure determination","authors":"Christian Tonnelier, Philippe Jauffret ∗, Thierry Hanser, Gérard Kaufmann","doi":"10.1016/0898-5529(90)90061-C","DOIUrl":"10.1016/0898-5529(90)90061-C","url":null,"abstract":"<div><p>In the context of automatic knowledge acquisition for computer-assisted synthesis planning, this paper presents an efficient algorithm for the identification of the maximal common substructures between reaction graphs. The terms of the problem are first completely specified. Then, the method used to solve it is presented and developed step by step. The formal algorithm is proposed as an appendix.</p></div>","PeriodicalId":101214,"journal":{"name":"Tetrahedron Computer Methodology","volume":"3 6","pages":"Pages 351-358"},"PeriodicalIF":0.0,"publicationDate":"1990-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0898-5529(90)90061-C","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90985594","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1990-01-01DOI: 10.1016/0898-5529(90)90168-8
Joseph B. Moon, W.Jeffrey Howe
Computer-based lead finding algorithms which attempt to design, on a de novo basis, ligands that will complement a known receptor site cavity face some major problems in terms of a combinatorial design space and the synthesizability of the designed molecules. On the other hand, typical 3D database search methods provide a different set of challenges. Both of these approaches are ultimately pointed toward the same goal and can be used together productively. In this article we describe advances in both areas: we first describe extensions to our de novo ligand design software which combines (a) a tree-based conformational search over a library of fragments, and (b) a form of simulated annealing which allows designed ligands to crawl around the binding site even as their structures are changing. In the second part, we then discuss an implementation of the database approach which allows users to formulate 3D substructure, superstructure, or similarity queries based upon demonstrated or hypothetical requirements for activity. Finally, we draw the two approaches together with an example of current research interest, showing how one method can feed the other.
{"title":"3D database searching and de novo construction methods in molecular design","authors":"Joseph B. Moon, W.Jeffrey Howe","doi":"10.1016/0898-5529(90)90168-8","DOIUrl":"10.1016/0898-5529(90)90168-8","url":null,"abstract":"<div><p>Computer-based lead finding algorithms which attempt to design, on a de novo basis, ligands that will complement a known receptor site cavity face some major problems in terms of a combinatorial design space and the synthesizability of the designed molecules. On the other hand, typical 3D database search methods provide a different set of challenges. Both of these approaches are ultimately pointed toward the same goal and can be used together productively. In this article we describe advances in both areas: we first describe extensions to our de novo ligand design software which combines (a) a tree-based conformational search over a library of fragments, and (b) a form of simulated annealing which allows designed ligands to crawl around the binding site even as their structures are changing. In the second part, we then discuss an implementation of the database approach which allows users to formulate 3D substructure, superstructure, or similarity queries based upon demonstrated or hypothetical requirements for activity. Finally, we draw the two approaches together with an example of current research interest, showing how one method can feed the other.</p></div>","PeriodicalId":101214,"journal":{"name":"Tetrahedron Computer Methodology","volume":"3 6","pages":"Pages 697-711"},"PeriodicalIF":0.0,"publicationDate":"1990-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0898-5529(90)90168-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77837362","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1990-01-01DOI: 10.1016/0898-5529(90)90155-2
Douglas R. Henry, Phil J. McHale, Bradley D. Christie, Daniel Hillman
The process of building large three-dimensional (3D) structural databases of commercial quality presents several unique challenges. The concerns which must be faced include database size, method of 3D structure generation, batch implementation of modeling and registration, correspondence with two-dimensional structures, and quality assurance of the resulting 3D structures. We describe procedures which were developed to build two databases with CONCORD: MACCS-II Drug Data Report-3D (MDDR-3D) and Fine Chemicals Directory-3D (FCD-3D). These procedures were developed to overcome limitations in the modeling process and to increase the efficiency and reliability of registration. This paper describes these programs and techniques, and reports on their performance in building large 3D structural databases.
构建具有商业质量的大型三维(3D)结构数据库的过程提出了几个独特的挑战。必须面对的问题包括数据库大小、三维结构生成方法、批量实现建模和注册、与二维结构的对应以及生成的三维结构的质量保证。我们描述了建立CONCORD两个数据库的程序:MACCS-II药物数据报告- 3d (mdr - 3d)和精细化学品目录- 3d (FCD-3D)。开发这些程序是为了克服建模过程中的局限性,提高配准的效率和可靠性。本文描述了这些程序和技术,并报告了它们在构建大型三维结构数据库中的性能。
{"title":"Building 3D structural databases: Experiences with MDDR-3D and FCD-3D","authors":"Douglas R. Henry, Phil J. McHale, Bradley D. Christie, Daniel Hillman","doi":"10.1016/0898-5529(90)90155-2","DOIUrl":"10.1016/0898-5529(90)90155-2","url":null,"abstract":"<div><p>The process of building large three-dimensional (3D) structural databases of commercial quality presents several unique challenges. The concerns which must be faced include database size, method of 3D structure generation, batch implementation of modeling and registration, correspondence with two-dimensional structures, and quality assurance of the resulting 3D structures. We describe procedures which were developed to build two databases with CONCORD: MACCS-II Drug Data Report-3D (MDDR-3D) and Fine Chemicals Directory-3D (FCD-3D). These procedures were developed to overcome limitations in the modeling process and to increase the efficiency and reliability of registration. This paper describes these programs and techniques, and reports on their performance in building large 3D structural databases.</p></div>","PeriodicalId":101214,"journal":{"name":"Tetrahedron Computer Methodology","volume":"3 6","pages":"Pages 531-536"},"PeriodicalIF":0.0,"publicationDate":"1990-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0898-5529(90)90155-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75971911","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1990-01-01DOI: 10.1016/0898-5529(90)90117-Q
Yvonne C. Martin
Structurally novel potential dopamine agonists were designed by searching databases of 3D structures to find templates that match geometric criteria and can be modified into molecules suggested for synthesis. A search of 54,296 3D structures from three different databases generated 499 structurally unique molecules that meet our geometric criteria for D-2 dopaminergic activity. The search identified 8 of 9 classes of known fused ring phenolic dopaminergic compounds and 62 other classes of fused ring compounds with potential activity. The low observed frequency of finding the same ring class more than once suggests that additional searches will design many additional molecules. Compound design based on 3D substructure searching methods appears to be equally applicable to suggesting new classes of compounds for beginning or for mature medicinal chemistry investigations and does not require the construction of special libraries of templates.
{"title":"Computer design of potentially bioactive molecules by geometric searching with ALADDIN","authors":"Yvonne C. Martin","doi":"10.1016/0898-5529(90)90117-Q","DOIUrl":"10.1016/0898-5529(90)90117-Q","url":null,"abstract":"<div><p>Structurally novel potential dopamine agonists were designed by searching databases of 3D structures to find templates that match geometric criteria and can be modified into molecules suggested for synthesis. A search of 54,296 3D structures from three different databases generated 499 structurally unique molecules that meet our geometric criteria for D-2 dopaminergic activity. The search identified 8 of 9 classes of known fused ring phenolic dopaminergic compounds and 62 other classes of fused ring compounds with potential activity. The low observed frequency of finding the same ring class more than once suggests that additional searches will design many additional molecules. Compound design based on 3D substructure searching methods appears to be equally applicable to suggesting new classes of compounds for beginning or for mature medicinal chemistry investigations and does not require the construction of special libraries of templates.</p></div>","PeriodicalId":101214,"journal":{"name":"Tetrahedron Computer Methodology","volume":"3 1","pages":"Pages 15-25"},"PeriodicalIF":0.0,"publicationDate":"1990-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0898-5529(90)90117-Q","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72884994","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1990-01-01DOI: 10.1016/0898-5529(90)90119-S
Janey K. Cringean, Catherine A. Pepperrell, Andrew R. Poirrette, Peter Willett ∗
This paper describes algorithms that select a set of fragment screens for chemical substructure searching. The algorithms take as input an alphanumerically ordered list of fragments, together with their frequencies of occurrence, and produce as output a partition of this list, each portion of which contains approximately the same number of fragment occurrences. The algorithms have been developed as part of an ongoing project to develop techniques for angle-based substructure searching in files of 3-D chemical molecules; however, they are applicable to any situation requiring the selection of a set of approximately equifrequently occurring descriptors. A Pascal implementation of one of the algorithms is included on disk as SCREENS.PAS.
{"title":"Selection of screens for three-dimensional substructure searching","authors":"Janey K. Cringean, Catherine A. Pepperrell, Andrew R. Poirrette, Peter Willett ∗","doi":"10.1016/0898-5529(90)90119-S","DOIUrl":"10.1016/0898-5529(90)90119-S","url":null,"abstract":"<div><p>This paper describes algorithms that select a set of fragment screens for chemical substructure searching. The algorithms take as input an alphanumerically ordered list of fragments, together with their frequencies of occurrence, and produce as output a partition of this list, each portion of which contains approximately the same number of fragment occurrences. The algorithms have been developed as part of an ongoing project to develop techniques for angle-based substructure searching in files of 3-D chemical molecules; however, they are applicable to any situation requiring the selection of a set of approximately equifrequently occurring descriptors. A Pascal implementation of one of the algorithms is included on disk as SCREENS.PAS.</p></div>","PeriodicalId":101214,"journal":{"name":"Tetrahedron Computer Methodology","volume":"3 1","pages":"Pages 37-46"},"PeriodicalIF":0.0,"publicationDate":"1990-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0898-5529(90)90119-S","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80525779","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1990-01-01DOI: 10.1016/0898-5529(90)90050-I
David W. Elrod , Gerald M. Maggiora , Robert G. Trenary
A general method for the prediction of organic reactions by a backpropagation neural network is described. Neural networks trained using modified Dugundji-Ugi BE-matrix representations gave excellent predictions of the regiochemistry for three different types of reactions: Markovnikov addition to alkenes, Diels-Alder and retro-Diels-Alder reactions, and Saytzeff elimination. The networks were able to extract reactivity information from examples of the reactions to develop an internal representation of the reactions without explicitly incorporating rules into the network. Since the neural network was better at interpolating than extrapolating, it is important that the training set span the set of possible reactions. The method of representation used is sufficiently general to handle most classes of organic reactions.
{"title":"Applications for neural networks in chemistry. 2. A general connectivity representation for the prediction of regiochemistry","authors":"David W. Elrod , Gerald M. Maggiora , Robert G. Trenary","doi":"10.1016/0898-5529(90)90050-I","DOIUrl":"10.1016/0898-5529(90)90050-I","url":null,"abstract":"<div><p>A general method for the prediction of organic reactions by a backpropagation neural network is described. Neural networks trained using modified Dugundji-Ugi BE-matrix representations gave excellent predictions of the regiochemistry for three different types of reactions: Markovnikov addition to alkenes, Diels-Alder and retro-Diels-Alder reactions, and Saytzeff elimination. The networks were able to extract reactivity information from examples of the reactions to develop an internal representation of the reactions without explicitly incorporating rules into the network. Since the neural network was better at interpolating than extrapolating, it is important that the training set span the set of possible reactions. The method of representation used is sufficiently general to handle most classes of organic reactions.</p></div>","PeriodicalId":101214,"journal":{"name":"Tetrahedron Computer Methodology","volume":"3 3","pages":"Pages 163-174"},"PeriodicalIF":0.0,"publicationDate":"1990-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0898-5529(90)90050-I","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89892957","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1990-01-01DOI: 10.1016/0898-5529(90)90048-D
Joseph D. Bryngelson , J.J. Hopfield , Samuel N. Southard Jr
A new protein folding model for obtaining low-level structure information from sequence is constructed. Its form is related both to a parameterized energy function to represent the folding problem and a feed-back “neural network”. The values of unknown physical quantities appear as free parameters in this potential function. Ideas from the study of neural network models are used to develop a learning algorithm that finds values for the free parameters by using the database of known protein structures. This algorithm can be implemented in parallel on a multicomputer. The ideas are illustrated on a simple model of α-helix formation and prediction and used to investigate the role of hydrophobic forces in stabilizing helix hydrogen bonds.
{"title":"A protein structure predictor based on an energy model with learned parameters","authors":"Joseph D. Bryngelson , J.J. Hopfield , Samuel N. Southard Jr","doi":"10.1016/0898-5529(90)90048-D","DOIUrl":"10.1016/0898-5529(90)90048-D","url":null,"abstract":"<div><p>A new protein folding model for obtaining low-level structure information from sequence is constructed. Its form is related both to a parameterized energy function to represent the folding problem and a feed-back “neural network”. The values of unknown physical quantities appear as free parameters in this potential function. Ideas from the study of neural network models are used to develop a learning algorithm that finds values for the free parameters by using the database of known protein structures. This algorithm can be implemented in parallel on a multicomputer. The ideas are illustrated on a simple model of α-helix formation and prediction and used to investigate the role of hydrophobic forces in stabilizing helix hydrogen bonds.</p></div>","PeriodicalId":101214,"journal":{"name":"Tetrahedron Computer Methodology","volume":"3 3","pages":"Pages 129-141"},"PeriodicalIF":0.0,"publicationDate":"1990-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0898-5529(90)90048-D","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89325304","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}