Abstract
Molecular simulation techniques are increasingly being used to study biomolecular systems at an atomic level. Such simulations rely on empirical force fields to represent the intermolecular interactions. There are many different force fields available - each based on a different set of assumptions and thus requiring different parametrization procedures. Recently, efforts have been made to fully automate the assignment of force-field parameters, including atomic partial charges, for novel molecules. In this work, we focus on a problem arising in the automated parametrization of molecules for use in combination with the gromos family of force fields: namely, the assignment of atoms to charge groups such that for every charge group the sum of the partial charges is ideally equal to its formal charge. In addition, charge groups are required to have size at most k. We show -hardness and give an exact algorithm that solves practical problem instances to provable optimality in a fraction of a second.
Original language | English (US) |
---|---|
Pages (from-to) | 188-198 |
Number of pages | 11 |
Journal | Journal of Computational Biology |
Volume | 20 |
Issue number | 3 |
DOIs | |
State | Published - Mar 1 2013 |
All Science Journal Classification (ASJC) codes
- Modeling and Simulation
- Molecular Biology
- Genetics
- Computational Mathematics
- Computational Theory and Mathematics