A branch-and-bound method for optimal atom-type assignment in de novo ligand design

被引：0

|

作者：

Department of Pharmacology, University of Cambridge, Tennis Court Road, Cambridge CB2 1QJ, United Kingdom ^{[1
]}

机构：

来源：

J. Comp.-Aided Mol. Des. | / 4卷 / 335期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

相关论文

共 35 条

[31] Search for K-best solutions in optimal design of energy supply systems by an extended MILP hierarchical branch and bound method
Yokoyama, Ryohei
Shinano, Yuji
Taniguchi, Syusuke
Wakui, Tetsuya
ENERGY, 2019, 184 : 45 - 57
[32] THE ATOM ASSIGNMENT PROBLEM IN AUTOMATED DE-NOVO DRUG DESIGN .5. TESTS FOR ENVELOPE-DIRECTED FRAGMENT PLACEMENT BASED ON MOLECULAR SIMILARITY
BARAKAT, MT
DEAN, PM
JOURNAL OF COMPUTER-AIDED MOLECULAR DESIGN, 1995, 9 (05) : 457 - 462
[33] THE ATOM ASSIGNMENT PROBLEM IN AUTOMATED DE-NOVO DRUG DESIGN .4. TESTS FOR SITE-DIRECTED FRAGMENT PLACEMENT BASED ON MOLECULAR COMPLEMENTARITY
BARAKAT, MT
DEAN, PM
JOURNAL OF COMPUTER-AIDED MOLECULAR DESIGN, 1995, 9 (05) : 448 - 456
[34] THE ATOM ASSIGNMENT PROBLEM IN AUTOMATED DE-NOVO DRUG DESIGN .3. ALGORITHMS FOR OPTIMIZATION OF FRAGMENT PLACEMENT ONTO 3D MOLECULAR GRAPHS
BARAKAT, MT
DEAN, PM
JOURNAL OF COMPUTER-AIDED MOLECULAR DESIGN, 1995, 9 (04) : 359 - 372
[35] A New Hybrid Neural Network Deep Learning Method for Protein-Ligand Binding Affinity Prediction and De Novo Drug Design
Limbu, Sarita
Dakshanamurthy, Sivanesan
INTERNATIONAL JOURNAL OF MOLECULAR SCIENCES, 2022, 23 (22)

← 1 2 3 4 →