Ekaterina V. Gordeeva, Marina S. Molchanova, Nikolai S. Zefirov ∗
{"title":"用分子连通性指数详尽恢复化学结构的一般方法和计算机程序。QSAR/QSPR中逆问题的求解","authors":"Ekaterina V. Gordeeva, Marina S. Molchanova, Nikolai S. Zefirov ∗","doi":"10.1016/0898-5529(90)90066-H","DOIUrl":null,"url":null,"abstract":"<div><p>The first attempt to attack an intriguing inverse problem in QSAR/QSPR is presented. The special technique to the exhaustive targeted search of the structures with a given value of molecular connectivity index is described. The general methodology and the combinatorial algorithm are considered. The selection criteria for the correct generation of graphs and multigraphs with the given distribution of edge types or vertex types are developed. The RING program for the exhaustive generation of structures with the given connectivity index is described, and several examples of its successful application are discussed. A demo version of RING is included in this issue.</p></div>","PeriodicalId":101214,"journal":{"name":"Tetrahedron Computer Methodology","volume":"3 6","pages":"Pages 389-415"},"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)90066-H","citationCount":"32","resultStr":"{\"title\":\"General methodology and computer program for the exhaustive restoring of chemical structures by molecular connectivity indexes. Solution of the inverse problem in QSAR/QSPR\",\"authors\":\"Ekaterina V. Gordeeva, Marina S. Molchanova, Nikolai S. Zefirov ∗\",\"doi\":\"10.1016/0898-5529(90)90066-H\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The first attempt to attack an intriguing inverse problem in QSAR/QSPR is presented. The special technique to the exhaustive targeted search of the structures with a given value of molecular connectivity index is described. The general methodology and the combinatorial algorithm are considered. The selection criteria for the correct generation of graphs and multigraphs with the given distribution of edge types or vertex types are developed. The RING program for the exhaustive generation of structures with the given connectivity index is described, and several examples of its successful application are discussed. A demo version of RING is included in this issue.</p></div>\",\"PeriodicalId\":101214,\"journal\":{\"name\":\"Tetrahedron Computer Methodology\",\"volume\":\"3 6\",\"pages\":\"Pages 389-415\"},\"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)90066-H\",\"citationCount\":\"32\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Tetrahedron Computer Methodology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/089855299090066H\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Tetrahedron Computer Methodology","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/089855299090066H","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
General methodology and computer program for the exhaustive restoring of chemical structures by molecular connectivity indexes. Solution of the inverse problem in QSAR/QSPR
The first attempt to attack an intriguing inverse problem in QSAR/QSPR is presented. The special technique to the exhaustive targeted search of the structures with a given value of molecular connectivity index is described. The general methodology and the combinatorial algorithm are considered. The selection criteria for the correct generation of graphs and multigraphs with the given distribution of edge types or vertex types are developed. The RING program for the exhaustive generation of structures with the given connectivity index is described, and several examples of its successful application are discussed. A demo version of RING is included in this issue.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
