Automated partial atomic charge assignment for drug-like molecules: a fast knapsack approach
Abstract A key factor in computational drug design is the consistency and reliability with which intermolecular interactions between a wide variety of molecules can be described. Here we present a procedure to efficiently, reliably and automatically assign partial atomic charges to atoms based on kn...
Main Authors: | Martin S. Engler, Bertrand Caron, Lourens Veen, Daan P. Geerke, Alan E. Mark, Gunnar W. Klau |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2019-02-01
|
Series: | Algorithms for Molecular Biology |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1186/s13015-019-0138-7 |
Similar Items
-
Comparison of Dynamic Programming Algorithm and Greedy Algorithm on Integer Knapsack Problem in Freight Transportation
by: Global Ilham Sampurno, et al.
Published: (2018-05-01) -
A hybrid guided neighborhood search for the disjunctively constrained knapsack problem
by: Mhand Hifi, et al.
Published: (2015-12-01) -
CASE STUDY IN OPTIMAL TELEVISION ADVERTS SELECTION AS KNAPSACK PROBLEM
by: E. Ivokhin, et al.
Published: (2014-06-01) -
Integer 1/0 Knapsack Problem Dynamic Programming Approach in Building Maintenance Optimization
by: Viska Dewi Fawzy, et al.
Published: (2017-12-01) -
Approximation algorithms for minimum knapsack problem
by: Islam, Mohammad Tauhidul, et al.
Published: (2011)