Finding Optimal Discretization Orders for Molecular Distance Geometry by Answer Set Programming
The Molecular Distance Geometry Problem (MDGP) is the problem of finding the possible conformations of a molecule by exploiting available information about distances between some atom pairs. When particular assumptions are satisfied, the MDGP can be discretized, so that the search domain of the problem becomes a tree. This tree can be explored by using an interval Branch & Prune (iBP) algorithm. In this context, the order given to the atoms of the molecules plays an important role. In fact, the discretization assumptions are strongly dependent on the atomic ordering, which can also impact the computational cost of the iBP algorithm. In this work, we propose a new partial discretization order for protein backbones. This new atomic order optimizes a set of objectives, that aim at improving the iBP performances. The optimization of the objectives is performed by Answer Set Programming (ASP), a declarative programming language that allows to express our problem by a set of logical constraints. The comparison with previously proposed orders for protein backbones shows that this new discretization order makes iBP perform more efficiently.
KeywordsTotal Order Protein Backbone Interval Distance Discretization Order Reference Atom
We are thankful to the Brittany Region (France) and to the Brazilian research agencies FAPESP, CNPq for financial support.
- 3.A. Cassioli, B. Bardiaux, G. Bouvier, A. Mucherino, R. Alves, L. Liberti, M. Nilges, C. Lavor, T.E. Malliavin, An algorithm to enumerate all possible protein conformations verifying a set of distance restraints. BMC Bioinform. (2015, to appear)Google Scholar
- 4.A. Cassioli, O. Gunluk, C. Lavor, L. Liberti, Discretization vertex orders in distance geometry. Discrete Appl. Math. (2015, to appear)Google Scholar
- 7.T. Eiter, G. Ianni, T. Krennwallner, Answer set programming: a primer. Reason. Web 5689, 40–110 (2009)Google Scholar
- 9.M. Gelfond, Answer Sets, Handbook of Knowledge Representation, Chapter 7 (Elsevier, Amsterdam, 2007)Google Scholar
- 11.W. Gramacho, D. Gonçalves, A. Mucherino, N. Maculan, A new algorithm to finding discretizable orderings for distance geometry, in Proceedings of Distance Geometry and Applications (DGA13), Manaus, Amazonas, Brazil, pp. 149–152 (2013)Google Scholar
- 12.T.F. Havel, in Distance Geometry, Encyclopedia of nuclear magnetic resonance, ed. by D.M. Grant, R.K. Harris (Wiley, New York, 1995), pp. 1701–1710Google Scholar
- 20.A. Mucherino, On the Identification of Discretization Orders for Distance Geometry with Intervals, Lecture Notes in Computer Science 8085, in Proceedings of Geometric Science of Information (GSI13), ed. by F. Nielsen, F. Barbaresco, Paris, France, 2013, pp. 231–238Google Scholar
- 21.A. Mucherino, A Pseudo de Bruijn Graph Representation for Discretization Orders for Distance Geometry, Lecture Notes in Computer Science 9043, Lecture Notes in Bioinformatics series, ed. by F. Ortuño, I. Rojas, Proceedings of the 3rd International Work-Conference on Bioinformatics and Biomedical Engineering (IWBBIO15), Part I, Granada, Spain, 2015 pp. 514–523Google Scholar
- 24.J.B. Saxe, Embeddability of weighted graphs in \(k\)-space is strongly NP-hard, Proceedings of 17th Allerton Conference in Communications, Control and Computing, 480–489 (1979)Google Scholar