TY - JOUR
T1 - Charge group partitioning in biomolecular simulation
AU - Canzar, S.
AU - El-Kebir, M.
AU - Pool, R.
AU - Elbassioni, K.
AU - Malde, A.K.
AU - Mark, A.E.
AU - Geerke, D.P.
AU - Stougie, L.
AU - Klau, G.W.
PY - 2013
Y1 - 2013
N2 - 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. © Copyright 2013, Mary Ann Liebert, Inc. 2013.
AB - 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. © Copyright 2013, Mary Ann Liebert, Inc. 2013.
U2 - 10.1089/cmb.2012.0239
DO - 10.1089/cmb.2012.0239
M3 - Article
SN - 1066-5277
VL - 20
SP - 188
EP - 198
JO - Journal of Computational Biology
JF - Journal of Computational Biology
IS - 3
ER -