{"title":"分子设计中的三维数据库检索与从头构建方法","authors":"Joseph B. Moon, W.Jeffrey Howe","doi":"10.1016/0898-5529(90)90168-8","DOIUrl":null,"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.0000,"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":"31","resultStr":"{\"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\":null,\"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.0000,\"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\":\"31\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Tetrahedron Computer Methodology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/0898552990901688\",\"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/0898552990901688","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
3D database searching and de novo construction methods in molecular design
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.