11 research outputs found
Clusters of polyhedra in spherical confinement
What is the best way to pack objects into a container? This simple question, one that is relevant to everyday life, biology, and nanoscience, is easy to state but surprisingly difficult to answer. Here, we use computational methods to determine dense packings of a set of polyhedra inside a sphere, for up to 60 constituent packers. Our dense packings display a wide variety of symmetries and structures, and indicate that the presence of the spherical container suppresses packing effects due to polyhedral shape. Our results have implications for a range of biological phenomena and experimental applications, including blood clotting, cell aggregation, drug delivery, colloidal engineering, and the creation of metamaterials
Recommended from our members
Predicting multibody assembly of proteins
textThis thesis addresses the multi-body assembly (MBA) problem in the context of protein assemblies. [...] In this thesis, we chose the protein assembly domain because accurate and reliable computational modeling, simulation and prediction of such assemblies would clearly accelerate discoveries in understanding of the complexities of metabolic pathways, identifying the molecular basis for normal health and diseases, and in the designing of new drugs and other therapeutics. [...] [We developed] FÂČDock (Fast Fourier Docking) which includes a multi-term function which includes both a statistical thermodynamic approximation of molecular free energy as well as several of knowledge-based terms. Parameters of the scoring model were learned based on a large set of positive/negative examples, and when tested on 176 protein complexes of various types, showed excellent accuracy in ranking correct configurations higher (FÂČ Dock ranks the correcti solution as the top ranked one in 22/176 cases, which is better than other unsupervised prediction software on the same benchmark). Most of the protein-protein interaction scoring terms can be expressed as integrals over the occupied volume, boundary, or a set of discrete points (atom locations), of distance dependent decaying kernels. We developed a dynamic adaptive grid (DAG) data structure which computes smooth surface and volumetric representations of a protein complex in O(m log m) time, where m is the number of atoms assuming that the smallest feature size h is [theta](r[subscript max]) where r[subscript max] is the radius of the largest atom; updates in O(log m) time; and uses O(m)memory. We also developed the dynamic packing grids (DPG) data structure which supports quasi-constant time updates (O(log w)) and spherical neighborhood queries (O(log log w)), where w is the word-size in the RAM. DPG and DAG together results in O(k) time approximation of scoring terms where k << m is the size of the contact region between proteins. [...] [W]e consider the symmetric spherical shell assembly case, where multiple copies of identical proteins tile the surface of a sphere. Though this is a restricted subclass of MBA, it is an important one since it would accelerate development of drugs and antibodies to prevent viruses from forming capsids, which have such spherical symmetry in nature. We proved that it is possible to characterize the space of possible symmetric spherical layouts using a small number of representative local arrangements (called tiles), and their global configurations (tiling). We further show that the tilings, and the mapping of proteins to tilings on arbitrary sized shells is parameterized by 3 discrete parameters and 6 continuous degrees of freedom; and the 3 discrete DOF can be restricted to a constant number of cases if the size of the shell is known (in terms of the number of protein n). We also consider the case where a coarse model of the whole complex of proteins are available. We show that even when such coarse models do not show atomic positions, they can be sufficient to identify a general location for each protein and its neighbors, and thereby restricts the configurational space. We developed an iterative refinement search protocol that leverages such multi-resolution structural data to predict accurate high resolution model of protein complexes, and successfully applied the protocol to model gp120, a protein on the spike of HIV and currently the most feasible target for anti-HIV drug design.Computer Science
Statistical methods for polyhedral shape classification with incomplete data - application to cryo-electron tomographic images
A certain type of bacterial inclusion, known as a bacterial microcompartment, was recently identified and imaged through cryo-electron tomography. A reconstructed 3D object from single-axis limited angle tilt-series cryo-electron tomography contains missing regions and this problem is known as the missing wedge problem. Due to missing regions on the reconstructed images, analyzing their 3D structures is a challenging problem. The existing methods overcome this problem by aligning and averaging several similar shaped objects. These schemes work well if the objects are symmetric and several objects with almost similar shapes and sizes are available. Since the bacterial inclusions studied here are not symmetric, are deformed, and show a wide range of shapes and sizes, the existing approaches are not appropriate. This research develops new statistical methods for analyzing geometric properties, such as volume, symmetry, aspect ratio, polyhedral structures etc., of these bacterial inclusions in presence of missing data. These methods work with deformed and non-symmetric varied shaped objects and do not necessitate multiple objects for handling the missing wedge problem. The developed methods and contributions include: (a) an improved method for manual image segmentation, (b) a new approach to 'complete' the segmented and reconstructed incomplete 3D images, (c) a polyhedral structural distance model to predict the polyhedral shapes of these microstructures, (d) a new shape descriptor for polyhedral shapes, named as polyhedron profile statistic, and (e) the Bayes classifier, linear discriminant analysis and support vector machine based classifiers for supervised incomplete polyhedral shape classification. Finally, the predicted 3D shapes for these bacterial microstructures belong to the Johnson solids family, and these shapes along with their other geometric properties are important for better understanding of their chemical and biological characteristics
Entangled graphs on surfaces in space
In the chemical world, as well as the physical, strands get tangled. When those strands form loops, the mathematical discipline of âknot theoryâ can be used to analyse and describe the resultant tangles. However less has been studied about the situation when the strands branch and form entangled loops in either finite structures or infinite periodic structures. The branches and loops within the structure form a âgraphâ, and can be described by mathematical âgraph theoryâ, but when graph theory concerns itself with the way that a graph can fit in space, it typically focuses on the simplest ways of doing so. Graph theory thus provides few tools for understanding graphs that are entangled beyond their simplest spatial configurations.
This thesis explores this gap between knot theory and graph theory. It is focussed on the introduction of small amounts of entanglement into finite graphs embedded in space. These graphs are located on surfaces in space, and the surface is chosen to allow a limited amount of complexity. As well as limiting the types of entanglement possible, the surface simplifies the analysis of the problem â reducing a three-dimensional problem to a two-dimensional one.
Through much of this thesis, the embedding surface is a torus (the surface of a doughnut) and the graph embedded on the surface is the graph of a polyhedron. Polyhedral graphs can be embedded on a sphere, but the addition of the central hole of the torus allows a certain amount of freedom for the entanglement of the edges of the graph. Entanglements of the five Platonic polyhedra (tetrahedron, octahedron, cube, dodecahedron, icosahedron) are studied in depth through their embeddings on the torus. The structures that are produced in this way are analysed in terms of their component knots and links, as well as their symmetry and energy.
It is then shown that all toroidally embedded tangled polyhedral graphs are necessarily chiral, which is an important property in biochemical and other systems. These finite tangled structures can also be used to make tangled infinite periodic nets; planar repeating subgraphs within the net can be systematically replaced with a tangled version, introducing a controlled level of entanglement into the net.
Finally, the analysis of entangled structures simply in terms of knots and links is shown to be deficient, as a novel form of tangling can exist which involves neither knots nor links. This new form of entanglement is known as a ravel. Different types of ravels can be localised to the immediate vicinity of a vertex, or can be spread over an arbitrarily large scope within a finite graph or periodic net. These different forms of entanglement are relevant to chemical and biochemical self-assembly, including DNA nanotechnology and metal-ligand complex crystallisation
Recommended from our members
DISTORTION-CONTROLLED ISOTROPIC SWELLING AND SELF-ASSEMBLY OF TRIPLY-PERIODIC MINIMAL SURFACES
In the first part of this thesis, I propose a method that allows us to construct optimal swelling patterns that are compatible with experimental constraints. This is done using a greedy algorithm that systematically increases the perimeter of the target surface with the help of minimum length cuts. This reduces the areal distortion that comes from the changing Gaussian curvature of the sheet. The results of our greedy cutting algorithm are tested on surfaces of constant and varying Gaussian curvature, and are additionally validated with finite thickness simulations using a modified Seung-Nelson model.
In the second part of the thesis, we focus on self-assembly methods as an alternate approach to program specific desired structures. More specifically, we develop theoretical design rules for triply-periodic minimal surfaces (TPMS) and show how their symmetry properties can be used to program a minimum number triangular particle-types that successfully coalesce into the TPMS shape. We finally simulate our design rules with Monte Carlo methods and study the robustness of the self-assembled structures upon changing different system parameters like elastic moduli
Nanoinformatics
Machine learning; Big data; Atomic resolution characterization; First-principles calculations; Nanomaterials synthesi
Nanoinformatics
Machine learning; Big data; Atomic resolution characterization; First-principles calculations; Nanomaterials synthesi
Mathematical surfaces models between art and reality
In this paper, I want to document the history of the mathematical surfaces models used for the didactics of pure and applied âHigh Mathematicsâ and as art pieces. These models were built between the second half of nineteenth century and the 1930s. I want here also to underline several important links that put in correspondence conception and construction of models with scholars, cultural institutes, specific views of research and didactical studies in mathematical sciences and with the world of the figurative arts furthermore. At the same time the singular beauty of form and colour which the models possessed, aroused the admiration of those entirely ignorant of their mathematical attraction
Courbure discrÚte : théorie et applications
International audienceThe present volume contains the proceedings of the 2013 Meeting on discrete curvature, held at CIRM, Luminy, France. The aim of this meeting was to bring together researchers from various backgrounds, ranging from mathematics to computer science, with a focus on both theory and applications. With 27 invited talks and 8 posters, the conference attracted 70 researchers from all over the world. The challenge of finding a common ground on the topic of discrete curvature was met with success, and these proceedings are a testimony of this wor