Better Partitions of Protein Graphs for Subsystem Quantum Chemistry
Determining the interaction strength between proteins and small molecules is key to analyzing their biological function. Quantum-mechanical calculations such as Density Functional Theory (DFT) give accurate and theoretically well-founded results. With common implementations the running time of DFT calculations increases quadratically with molecule size. Thus, numerous subsystem-based approaches have been developed to accelerate quantum-chemical calculations. These approaches partition the protein into different fragments, which are treated separately. Interactions between different fragments are approximated and introduce inaccuracies in the calculated interaction energies.
To minimize these inaccuracies, we represent the amino acids and their interactions as a weighted graph in order to apply graph partitioning. None of the existing graph partitioning work can be directly used, though, due to the unique constraints in partitioning such protein graphs. We therefore present and evaluate several algorithms, partially building upon established concepts, but adapted to handle the new constraints. For the special case of partitioning a protein along the main chain, we also present an efficient dynamic programming algorithm that yields provably optimal results. In the general scenario our algorithms usually improve the previous approach significantly and take at most a few seconds.
KeywordsDensity Functional Theory Main Chain Graph Partitioning Naive Approach Balance Partition
- 2.Buluç, A., Meyerhenke, H., Safro, I., Sanders, P., Schulz, C.: Recent advances in graph partitioning. Accepted as Chapter in AlgorithmEngineering, Overview Paper concerning the DFG SPP 1307 (2016). Preprint available at http://arxiv.org/abs/1311.3144
- 4.Cramer, C.J.: Essentials of Computational Chemistry. Wiley, New York (2002)Google Scholar
- 8.Fiduccia, C., Mattheyses, R.: A linear time heuristic for improving network partitions. In: Proceedings of the 19th ACM/IEEE Design Automation Conference, Las Vegas, NV, pp. 175–181, June 1982Google Scholar
- 9.Guerra, C.F., Snijders, J.G., te Velde, G., Baerends, E.J.: Towards an order-N DFT method. Theor. Chem. Acc. 99, 391 (1998)Google Scholar
- 10.Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete problems. In: Proceedings of the 6th Annual ACM Symposium on Theory of Computing (STOC 1974), pp. 47–63. ACM Press (1974)Google Scholar
- 14.Hendrickson, B., Leland, R.: A multi-level algorithm for partitioning graphs. In: Proceedings Supercomputing 1995, p. 28. ACM Press (1995)Google Scholar
- 17.Jensen, F.: Introduction to Computational Chemistry, 2nd edn. Wiley, Chichester (2007)Google Scholar
- 26.Staudt, C., Sazonovs, A., Meyerhenke, H.: NetworKit: an interactive tool suite for high-performance networkanalysis. CoRR, abs/1403.3005 (2014)Google Scholar
- 28.von Looz, M., Wolter, M., Jacob, C.,Meyerhenke, H.: Better partitions of protein graphs for subsystem quantum chemistry. Technical Report 5, Karlsruhe Institute of Technology (KIT), 3 (2016). http://digbib.ubka.uni-karlsruhe.de/volltexte/1000052814