اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدHeuristic decomposition of cones in molecular conformational space
107
0
0.0
(
0
)
تأليف
Jacques Gabarro-Arpa
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In a previous work arXiv:physics/0611108v2, it was shown that the volume spanned by a molecular system in its conformational space can be effectively bounded by a polyhedral cone, this cone is described by means of a simple combinatorial formula. On the other hand it was constructed a transversal graph structure encoding the region of conformational space accessible to the system. From the information in this graph, it is possible to decompose the main cone into a hierarchy of smaller ones that are more manageable, and are progressively more tightly bound to the region in which the system evolves.
قيم البحث
اقرأ أيضاً
On the basis of empirical evidence from molecular dynamics simulations, molecular conformational space can be described by means of a partition of central conical regions characterized by the dominance relations between cartesian coordinates. This wo
rk presents a geometric and combinatorial description of this structure.
In previous works it was shown that protein 3D-conformations could be encoded into discrete sequences called dominance partition sequences (DPS), that generated a linear partition of molecular conformational space into regions of molecular conformati
ons that have the same DPS. In this work we describe procedures for building in a cubic lattice the set of 3D-conformations that are compatible with a given DPS. Furthermore, this set can be structured as a graph upon which a combinatorial algorithm can be applied for computing the mean energy of the conformations in a cell.
In a previous work a procedure was decribed for dividing the $3 times N$-dimensional conformational space of a molecular system into a number of discrete cells, this partition allowed the building of a combinatorial structure from data sampled in mol
ecular dynamics trajectories: the graph of cells or G, encoding the set of cells in conformational space that are visited by the system in its thermal wandering. The information in G however, is encoded in a great number of fragments that must be aggregated. We describe here the algorithmic procedures 1) for aggregating the information from G into an hypergraph allowing to enumerate the relevant cells from conformational space, and 2) for puttting the data in a very compact format.
In previous works [physics/0204035, physics/0404052, physics/0509126] a procedure was described for dividing the $3 times N$-dimensional conformational space of a molecular system into a number of discrete cells, this partition allowed the building o
f a combinatorial structure from data sampled in molecular dynamics trajectories: the graph of cells, that encodes the set of cells in conformational space that are visited by the system in its thermal wandering. Here we outline a set of procedures for extracting useful information from this structure: 1st) interesting regions in the volume occupied by the system in conformational space can be bounded by a polyhedral cone whose faces are determined empirically from a set of relations between the coordinates of the molecule, 2nd) it is also shown that this cone can be decomposed into a hierarchical set of smaller cones, 3rd) the set of cells in a cone can be encoded by a simple combinatorial sequence.
In the first work of this series [physics/0204035] it was shown that the conformational space of a molecule could be described to a fair degree of accuracy by means of a central hyperplane arrangement. The hyperplanes divide the espace into a hierarc
hical set of cells that can be encoded by the face lattice poset of the arrangement. The model however, lacked explicit rotational symmetry which made impossible to distinguish rotated structures in conformational space. This problem was solved in a second work [physics/0404052] by sorting the elementary 3D components of the molecular system into a set of morphological classes that can be properly oriented in a standard 3D reference frame. This also made possible to find a solution to the problem that is being adressed in the present work: for a molecular system immersed in a heat bath we want to enumerate the subset of cells in conformational space that are visited by the molecule in its thermal wandering. If each visited cell is a vertex on a graph with edges to the adjacent cells, here it is explained how such graph can be built.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
