Christian Tonnelier, Philippe Jauffret ∗, Thierry Hanser, Gérard Kaufmann
{"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":null,"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.0000,"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":"17","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Tetrahedron Computer Methodology","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/089855299090061C","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17
Abstract
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
