Skip to main content
Proceedings of the National Academy of Sciences of the United States of America logoLink to Proceedings of the National Academy of Sciences of the United States of America
. 2018 Jul 3;115(29):E6690–E6696. doi: 10.1073/pnas.1722681115

Universal folding pathways of polyhedron nets

Paul M Dodd a, Pablo F Damasceno b, Sharon C Glotzer a,b,c,d,1
PMCID: PMC6055160  PMID: 29970420

Significance

What makes an object successful at thermal folding? Protein scientists study how sequence affects the pathways by which chained amino acids fold and the structures into which they fold. Here we investigate the inverse problem: Starting with a 3D object as a polyhedron we ask, which ones, among the many choices of 2D unfoldings, are able to fold most consistently? We find that these “nets” follow a universal balance between entropy loss and potential energy gain, allowing us to explain why some of their geometrical attributes (such as compactness) represent a good predictor for the folding propensity of a given shape. Our results can be used to guide the stochastic folding of nanoscale objects into drug-delivery devices and thermally folded robots.

Keywords: folding, origami, polyhedra nets, cooperativity

Abstract

Low-dimensional objects such as molecular strands, ladders, and sheets have intrinsic features that affect their propensity to fold into 3D objects. Understanding this relationship remains a challenge for de novo design of functional structures. Using molecular dynamics simulations, we investigate the refolding of the 24 possible 2D unfoldings (“nets”) of the three simplest Platonic shapes and demonstrate that attributes of a net’s topology—net compactness and leaves on the cutting graph—correlate with thermodynamic folding propensity. To explain these correlations we exhaustively enumerate the pathways followed by nets during folding and identify a crossover temperature Tx below which nets fold via nonnative contacts (bonds must break before the net can fold completely) and above which nets fold via native contacts (newly formed bonds are also present in the folded structure). Folding above Tx shows a universal balance between reduction of entropy via the elimination of internal degrees of freedom when bonds are formed and gain in potential energy via local, cooperative edge binding. Exploiting this universality, we devised a numerical method to efficiently compute all high-temperature folding pathways for any net, allowing us to predict, among the combined 86,760 nets for the remaining Platonic solids, those with highest folding propensity. Our results provide a general heuristic for the design of 2D objects to stochastically fold into target 3D geometries and suggest a mechanism by which geometry and folding propensity are related above Tx, where native bonds dominate folding.


In the 16th century, the Dutch artist Albrecht Dürer investigated which 2D cuts of nonoverlapping, edge-joined polygons could be folded into Platonic and Archimedean polyhedra. Dürer cuts were later called “nets” but, for a long time, the interest around them was mostly restricted to the field of mathematics (13). A newer concept, self-folding origami, adds a modern twist to the ancient art of paper folding. By providing a mechanism to achieve complex 3D geometries from low-dimensional objects—without the need for manipulation of the constituent parts—self-folding brings the concepts pioneered by Dürer to the forefront of many research fields, from medicine (4) to robotics (5).

Several recent works have leveraged physical forces to achieve controllable folding of 3D objects including light (6), pH (7), capillary forces (8), cellular traction (9), and thermal expansion (10). Other works have investigated the relationship between geometric attributes of the object being folded and its propensity for successful folding. In the macroscopic folding of kirigami sheets—origami-like structures containing cuts and creases—the effect of different cut patterns on the material’s stress–strain behavior has been elucidated (1113) and the “inverse design problem” of finding cuts leading to the folding of a particular target structure has been solved (14). For submillimeter-sized capsules, formed via nonstochastic folding of nets into polyhedra, it has been suggested that nets fold with higher yield when they are compact (8, 15, 16), but the reason for this correlation remains unclear. In natural systems, the canonical example of self-folding occurs for proteins, where a string of amino acids navigate, thermodynamically, from a denatured (unfolded) state to a natured (folded) one. Even after many decades of study, however, a universal relationship between molecular sequence and folded state—which could provide crucial insight into the causes and potential treatments of many diseases—remains out of reach (1113).

In this work, we study the thermodynamic foldability of 2D nets for all five Platonic solids. Despite being the simplest and most symmetric 3D polytopes, the family of Platonic shapes suffices to demonstrate the rapid increase in design space as shapes become more complex: A tetrahedron has 2 possible net representations, cubes and octahedra each have 11 nets, and dodecahedra and icosahedra have, each, 43,380 distinct edge unfoldings. Here we are interested in the thermodynamic self-folding of these nets. Our goal is to understand how topology affects yield in the stochastic folding of 3D objects. The advantage is threefold. First, by using a collection of sheets folding into the same target shape, we isolate the geometric attributes responsible for high-yield folding. Second, the model allows exhaustive computation of the pathways followed by the nets during folding, elucidating how some nets achieve high yield. Third, by studying increasingly more complex objects—from tetrahedra to icosahedra—we can use the folding mechanisms quantified in the simplest objects to predict, and potentially validate, their occurrence in the more complex shapes.

Beginning with a target Platonic shape (Fig. 1), we construct a graph whose vertices and edges correspond to those in the polyhedron. This mapping of the shape to a graph facilitates the exhaustive search of all distinct nets by allowing spanning tree enumeration (3). A set of prechosen edges (the cutting tree) is then cut, in a process called edge unfolding, to create a single, contiguous, and flat 2D sheet of nonoverlapping faces: a net. For the Platonic shapes, whose nets are enumerated (17), this can be repeated exhaustively until all distinct nets are discovered (see Materials and Methods for more details). We note that for other shapes, while the process of computing all nets might become computationally prohibitive, it has been recently demonstrated that a subset of interest for these nets can be computed algorithmically (18). We list all 86,784 nets for the Platonic solids in a database (19).

Fig. 1.

Fig. 1.

Workflow for polyhedra folding study. Starting with a target 3D polytope (top, and moving clockwise), a graph representation is used to enumerate different permutations of edge cuttings. The vertices (edges) in the so-called cutting tree graph correspond to the vertices (edges) of the polyhedron. Red edges in the cutting tree mark those being cut. From the cutting tree, a planar, hinged connection of nonoverlapping faces (a net) results. Each face of the net is then modeled as a union of spheres rigidly held together, tethered along hinges via harmonic springs. In the MD model shown, gray spheres interact via a Lennard–Jones potential. Blue spheres interact with each other and with gray spheres via a purely repulsive WCA potential. The simulations are initialized at high temperature and brought to low temperature following either a fast quench or a slow annealing protocol. Once the final temperature is reached, the final configuration is compared with the target shape. The folding yield is then calculated as the probability of achieving the desired 3D shape via the particular cooling protocol.

Each net is modeled as a sheet of rigid polygons connected to adjacent polygons via harmonic springs. The polygons are composed of rigidly connected spheres and the influence of thermal fluctuations on a single net, suspended in implicit solvent, is modeled via Langevin molecular dynamics (more details in Materials and Methods). We assign nonspecific, short-ranged attractive (sticky) interactions between all edges not joined by springs of a net so that the polyhedron formed from folding is also the ground-state configuration. This does not guarantee, however, the uniqueness of the ground state and, as we will see, other 3D foldings can arise. Unless explicitly noted otherwise, by “folded state” we refer to the original polyhedron.

As in proteins and other biomolecules, the nonspecificity of the interactions between edges of the nets allows for both native and nonnative contacts. As a consequence, when the system temperature is rapidly decreased (quenched), kinetic traps are possible and net misfolds are observed. This possibility for kinetic traps raises the following question: Among all nets generated by unfolding a polyhedron, which of them show the highest propensity to refold into the original polyhedron?

More Compact, “Leafy” Nets Fold More Reliably

To identify the nets able to fold reliably into their polyhedron of origin we performed hundreds of cooling simulations for each net, using both a fast and a slow cooling protocol (see Materials and Methods section for more details). The two distinct nets for the tetrahedron, hereafter referred to as the triangular net and the linear net (Fig. 2A), showed remarkably different folding propensities for the fast cooling protocol: Of 125 simulations, all triangular nets folded into the target tetrahedron while only 54% of the linear nets succeeded—the other 46% of the experiments resulted in misfolded configurations. In general the slower cooling rate simulations yielded a higher folding probability for each net. This is expected as the net has more time to find the global minimum. Similar simulations for each of the 11 nets of both the cube and the octahedron revealed even larger differences: For the cube nets (Fig. 2B), only 3 of the nets showed greater than 50% success in folding, and only at slow cooling rates; for the octahedron (Fig. 2C), none of the nets achieve higher than 50% success rate for either cooling rate.

Fig. 2.

Fig. 2.

Effect of net topology on the folding probability for the simplest Platonic solids. Folding yield, defined by the fraction of simulations that reached the folded state, was calculated for two cooling rates. Nets for each polyhedron are ordered from highest to lowest yield at low cooling rate. (A) For the two tetrahedron nets [triangular (Top) and linear (Bottom)], a noticeable difference in folding success rate is visible for rapid cooling rates, but similar folding propensity is found for slower cooling rates. (B and C) For the cube nets (B) 8/11 nets fold poorly (below 50%) even for slow folding reactions while for the octahedron (C) most nets are unable to fold into the original shape. Generally the more compact nets fold better: Nets that have a high number of leaves on their cutting tree and a smaller diameter usually fold best.

The misfolded configurations for the tetrahedron and cube nets were incomplete 3D geometries (showing, for instance, faces collapsed on top of each other or bonds incompatible with the formation of the respective target shape). In contrast, octahedron nets often folded into another 3D shape: a concave, boat-like conformation with the same number of edge–edge contacts as the octahedron: in other words, a degenerate ground state. This competing structure, which is less symmetric than the octahedron, has higher rotational entropy resulting in a lower free energy than the octahedron (see SI Appendix, Fig. S1A for folding probabilities for the boat conformation). A competition between similar degenerate structures was reported for finite clusters of six attractive spherical colloids (20), where symmetry breaking leads to the formation of the same boat-like conformation.

Fig. 2 shows that, despite having the same ground-state energy, not all nets of a polyhedron are equivalent. In general, we observe that the nets that fold most reliably are the most compact and have the highest number of leaves on its cutting graph (green solid circles in nets in Fig. 2). A net is said to be more compact if it has a large number of leaves (the vertices with degree one on the cutting tree) and a small diameter (the longest shortest path between any two faces on the face graph). Exact values for the leaves and diameter are shown in SI Appendix, Table S1. Most strikingly, even nets differing only by the location of a single face can have folding probabilities reduced from 99% to 17%. What causes one shape to fold nearly perfectly every time while a slightly different one fails to do so almost as frequently? And why do net “leafiness” and “compactness” correlate with folding yield?

High-Temperature Folding Happens via Native Contacts

To answer why small differences in net topology can have a large impact on the net’s folding propensity, we used Markov-state models (MSM) (2123) to compute the pathways through which nets fold into their folded state. Since quench rate was observed to affect the folding propensity of the nets, we run constant temperature simulations of each net while computing the rate of transitions between two states (flux). A representative folding network is shown in Fig. 3A (see SI Appendix, Fig. S2 for other example networks). Arrows represent observed transitions between different states and each arrow has a thickness proportional to the probability flux of the transition being observed (see Materials and Methods for more details). To simplify, we show only the most visited pathways (i.e., those whose combined flux accounts for at least 50% of the total reactive flux between unfolded and folded states). Intermediate configurations can achieve the folded state via the formation of native (green) or nonnative (red) contacts. If a pathway includes native contacts only, every newly formed bond is compatible with the final polyhedron and error correction is not needed. When the folded state is achieved via incompatible bonds, we observe that these nonnative contacts can sometimes have an active role by bringing otherwise far-away native contacts closer together, facilitating folding. In other cases the nonactive contacts contribute only passively and folding occurs sequentially after the misfold occurs until it reaches a point where the nonnative contact must break for folding to continue. In either case, nonnative contacts must eventually break before a folded configuration can be achieved.

Fig. 3.

Fig. 3.

Folding pathways for a representative cubic net. (A) Intermediate folding states (nets, in the diagram), arise when new bonds between edges are formed. States are connected with an arrow when a pathway from one state to another is observed in the simulation. The thickness of such connection is proportional to the measured probability of this transition being observed. For better visualization, only the most visited states are shown. Red (green) faces correspond to a state where a nonnative (native) contact is formed. The pathways containing only native contacts follow a “sequential” folding process, where one face folds at a time. Nonnative pathways can lead to the native folded shape via one of two mechanisms: (i) Either the misfold helps, bringing otherwise far away faces together, or (ii) the folding proceeds sequentially after the misfold occurs until it reaches a point where the nonnative contact must break for folding to continue. In both cases, if the correct polyhedron is achieved in the end, the nonnative contact is corrected along the pathway. The network represents 55% of the folding flux at T=3kT. (B) The total probability flux, defined as the sum of the fluxes along all pathways, for the representative net in A as a function of temperature. The peak around temperature T=3kT shows that there is a temperature at which there is a maximum number of expected transitions from the unfolded to the folded state per unit time. (C) The relative amount of flux that goes through pathways that use the native (green curve) and nonnative (red curve) pathways. The folding seems to happen mostly via native contacts formation when the system is kept at higher temperatures.

The total flux connecting unfolded and folded states (Fig. 3B) first increases with temperature and then decreases to zero at high temperature. At low T the folding flux is low because the states are mostly trapped into a few configurations; i.e., the slow kinetics inhibit bond breaking. As the temperature increases, bonds can now break and the folding/unfolding process occurs at a higher rate. At intermediate T, a maximum in reactive flux is observed, meaning that there is a temperature at which there is a maximum number of expected transitions from unfolded to folded state per unit time τ. The representative network shown in Fig. 3A was calculated at that peak temperature. Finally, at high T the unfolded state is preferred and again the flux vanishes. These trends are also true for the other nets studied (SI Appendix, Fig. S3). If we separate the flux into those following native and nonnative contacts, we see (Fig. 3C) that the folding pathways at high temperature mostly follow the formation of native contacts while the behavior inverts for low temperatures, and mostly nonnative contacts are observed. There were only two nets where a crossover temperature was not observed. The triangular tetrahedral net does not exhibit a crossover temperature since it has no traps. The best-folding cubic net also does not have a crossover temperature in the range of temperatures we study; while traps exist, the fraction of native contacts decreases and the temperature decreases but never falls below 50% (SI Appendix, Fig. S3). This T dependency is also observed in colloids, where the assembly of an icosahedron is monomeric at high temperatures, but, at low temperature, particles first aggregate into large clusters (not necessarily compatible with icosahedral symmetry) and those later rearrange into the ground-state structure (24).

To gain an understanding of the mechanisms underlying the observation that native contacts are favored at high temperatures during folding, we calculated the number of degrees of freedom associated with each intermediate.

Nets Follow a Universal Balance Between Entropy and Enthalpy

The fact that more compact nets and those with many leaves generally fold with higher yield suggests that nets might fold locally, in a manner that reduces the fewest degrees of freedom, thereby maximizing the conformational entropy along the folding pathways. To test whether this trade-off between maximizing degrees of freedom and forming native contacts occurs at high T, we calculate the number N of internal degrees of freedom and the number Q of native contacts as a net folds. We do so for all 24 nets of the tetrahedron, cube, and octahedron. Fig. 4 shows that, remarkably, all nets follow a folding pathway that achieves a narrow balance between reduction of degrees of freedom and gain of potential energy. In practical terms, high-temperature folding happens locally such that, at each step of the process, the system strives to maximize its conformational entropy. From this observation, we hypothesize the following mechanism for the folding of general nets at high temperature. Folding should primarily happen (i) via nearby (local) connections, favoring compact nets with many leaves, and (ii) along one of the optimal trade-off paths, favoring nets with high degeneracy in the number of such optimal paths. Fig. 4 shows that, remarkably, all nets follow a folding pathway that achieves a narrow balance between reduction of degrees of freedom and gain of potential energy. In practical terms, high-temperature folding happens locally such that, at each step of the process, the system strives to maximize its conformational entropy. Importantly, this maximization does not necessarily occur at low temperatures as when intermediate nonnative contacts occur—and stages of the folding are found to lie far away from the narrow balance explained above (SI Appendix, Fig. S4).

Fig. 4.

Fig. 4.

Projected pathways computed from the MSM of all of the nets onto two order parameters: native contacts and number of internal degrees of freedom. We find that each net will trade its degrees of freedom in approximately the same way. The data points are weighted averages of the number of degrees of freedom over all pathways for each given value of Q/Qfolded. The lines are drawn to guide the eye. The upper right corner of the plot is a geometrically forbidden region arising from the fact that the net cannot gain a bond without losing at least 1 df. The temperature plotted for each net is given by Tm+0.5, and Tm is reported for each net in SI Appendix, Table S1. DOF, degree of freedom.

Using this hypothesis we devised an algorithm to generate high-temperature pathways for the 86,760 nets of the dodecahedron and icosahedron, without the need for a full MSM calculation. We do so by first enumerating candidate bonds that can be made if they are next to each other on the net or in the intermediate and then by selecting ones that have the largest number of degrees of freedom (see Materials and Methods for more details). Fig. 5 shows the combined example pathways followed by all 11 nets for the cube (Fig. 5A) and for the octahedron (Fig. 5B), illustrating the pathways that maximize degrees of freedom and using only local, native contacts to fold. We then used these principles to find, among the 86,760 nets, those with high and low folding yields (see SI Appendix, Figs. S5 and S6 for specific nets). The corresponding folding propensities are plotted in Fig. 6. As expected, polyhedra with many leaves and small diameter show higher propensity for correct folding and those nets also have many high-T pathways to the ground state. The correlation between the folding propensity and the leaves may have analogues in other systems as well. The number of leaves is a measure of the amount of local connections that are required to fold from the unfolded state. In the protein-folding literature the contact order is a measure of how far away specific native contacts are on the amino acid sequence and it has been shown that low contact order inversely correlates to folding rate (25).

Fig. 5.

Fig. 5.

Combined dominant pathways for the 11 nets of the cube (A) and the 11 nets of the octahedron (B) calculated at high temperature. In both cases the dominant pathways are sequential (one face folding at a time) and include only native contacts. As in Fig. 3, arrows indicate transitions between two states, the arrow thickness being proportional to the probability of observing such a transition.

Fig. 6.

Fig. 6.

Correlation between different geometric and topological quantities calculated for the net and the folding propensity, defined as the average fraction of native contacts formed across all 125 quenching simulations. Leaves are the vertices with degree one on the cutting tree, the diameter is the longest shortest path along the face graph, and the number of high-temperature pathways was calculated by enumerating the number of pathways that maximize the internal degrees of freedom at each step. Each row corresponds to the cube (red), octahedron (green), dodecahedron (orange), and icosahedron (purple), respectively; data for the tetrahedron were omitted because there are only two nets. Pearson coefficients and P values are reported in each panel. We found that the number of leaves provided the strongest linear correlation for both the cube and the octahedron (Pearson coefficients are 0.81 and 0.86, respectively) and so the number of leaves was used to try to predict the nets that would fold with both high and low propensity. In the bottom two rows (dodecahedron and icosahedron), the nets predicted to fold well are plotted with a solid circle and the nets predicted to fold poorly are plotted with a solid “x.” We find that while the number of leaves is a good predictor for the dodecahedron, the icosahedron still folds with relatively low propensity.

Overall, our observations suggest that folding propensity of a net decreases as the number of faces increases. For instance, while the 4-sided tetrahedron folds nearly perfectly, the 20-sided icosahedron is unable to successfully fold. One exception to this trend is the dodecahedron, which folds with higher probability than the octahedron. While the reason for this exception remains elusive, there are two factors that may play a role. The first factor is the number of degrees of freedom retained by the faces sharing a leaf vertex when the leaf edges form a bond. For instance, octahedron nets can make a bond about the leaf vertex, but due to the unique symmetry the loop, retain 1 df (i.e., the resulting intermediate is not rigid), so the intermediate may still enter a trapped state. In the case of the icosahedron, after folding about leaf vertices, the loop retains 2 df. In the case of the other three shapes (i.e., tetrahedron, cube, dodecahedron), folding about leaf vertices renders the loop rigid. This implies that further constraining the net by increasing the rigidity throughout the folding process is important to sufficiently funnel the net’s energy landscape and may boost the folding probability for many nets. The second factor is the complexity that arises in trapped states. There are “tetrahedral motifs” on many octahedral nets, and these motifs can fold into full or partial tetrahedra, as seen in the boat conformation mentioned above (see SI Appendix, Fig. S1A for more examples). For icosahedral nets, there are both tetrahedral and octahedral motifs, and the diversity of the trapped states is further increased for these nets. This is in sharp contrast to the nets of the other three shapes, for which trapped states typically occur when one face folds onto another face.

Discussion and Conclusion

The observed preference for native contact pathways at high temperature is not unique to polyhedron nets. Several small proteins have been observed in simulation to fold via native-only contacts when close to their melting temperature (26). At low T (or high hydrophobicity) the pathways shift to a hydrophobic collapse, in which nonnative contacts form followed by further rearrangements leading to the native state (27). Similarly, colloids assemble via monomeric pathways at high temperature, forming bonds that are compatible with the overall structure in an equivalent process to native contact formation (24). Finally, systems of colloidal sticky spheres prefer to form the same concave, boat-like conformation that we observe for octahedron nets (20).

Our simple model therefore draws connections between the macroscopic irreversible folding of polyhedra (8), assembly of patchy (24) and colloidal (20) particles, and the folding of amino acids (2628). The identified trade-off between entropy and enthalpy that dictates high-temperature folding provides guiding principles for the assembly of 3D complex geometries from potentially simpler-to-fabricate 2D nets. We demonstrated the judicious pathway engineering via the selection of nets with certain characteristics. We found that nets at high temperature fold through pathways that maximize the internal degrees of freedom, regardless of their propensity to fold, and the more compact nets fold with higher propensity. The compactness measures correlated with the number of pathways connecting the unfolded and folded states, offering some understanding on why these measures work well. In addition to giving insights into the thermodynamics of folding in naturally occurring systems, our results could also provide a route for the fabrication of anisotropic Brownian shells, paving the way for the self-assembly of complex crystals from nanoshells and colloidal shells (2932) capable of encapsulating cargo. We expect these results to impact future experiments on folding of graphene sheets (13), graphene oxide layers (12), or DNA–origami polyhedral nets (33).

Materials and Methods

Enumeration of Polyhedral Nets.

We create nets from polyhedra via a process known as edge unfolding. In edge unfolding, one cuts along a set of prechosen edges, called the cutting tree, of a polyhedron (e.g., a cube) to create a single, contiguous flat 2D sheet of connected (square) faces: a net. We enumerate all of the nets of each polyhedron by generating random weights for the edges of the skeleton-1 graph of the polyhedron on the interval [0, 1]. The minimal spanning tree was found using Kruskal’s algorithm (34). We then converted the spanning tree to a net and added it to the database if it did not already exist. We ran this loop for many iterations until we found all of the nets for each shape.

Langevin Dynamics and Molecular Dynamics Simulation.

Langevin dynamics are used to model the folding dynamics for each net using HOOMD-Blue (3538). Each face of the net is approximated by a union of spheres acting as a rigid body, with an edge length of 10 spheres. The spheres are arranged in a hexagonal lattice for triangular faces, a square lattice for square faces, and a hexagonal approximate for the pentagonal faces. For each simulation the drag coefficient, γ, was set to the inverse of the number of spheres used to create a facet. The spheres in the center of the face interact via a Weeks–Chandler–Andersen (WCA) potential shown in blue in Fig. 1, while the spheres on the free edges of the net interact via a Lennard–Jones potential; both potentials used ϵ and σ values of 1.0. The rigid facets are tethered together using harmonic springs along the edges, using a spring constant of 800 and equilibrium distance of 1.0.

Quantifying Yield.

To quantify the folding yield we ran 125 simulations starting from a high temperature and quenched the temperature to near zero (T=0.1). We then defined the yield as the fraction of simulations that completely folded into the target polyhedron. To distinguish between nets that had very low probability, we defined the folding propensity as the average fraction of native contacts averaged over all of the quenching simulations we ran. If all nets folded perfectly in all runs, the folding propensity is one but is possibly nonzero even if all nets did not fold at all. We linearly quenched 125 systems from 0.1 ≤ TTm + 2.5, where Tm is the folding temperature defined as the maximum melting temperature (temperature at which the net is unfolded 50% of the time) among all nets for a given target shape. We used two different cooling rates to investigate their influence in the folding yield: 2.5 ×106T/t and 2.5 ×108T/t. The Tm for each shape is listed in SI Appendix, Table S1.

MSMs and Folding Pathway Calculations.

MSMs (21) have been used to study protein folding (22, 23) and virus capsid assembly (39) and can provide a detailed view into the dynamics and thermodynamics of the folding landscape. In contrast to other methods to compute assembly pathways, which require monotonic order parameters (40) or hierarchical computation of the partition function (41), MSMs require each simulation snapshot to be classified as a discrete state, and the number of transitions between each state is recorded in a matrix. The dihedral angles completely specify the configuration of a net and are therefore a good set of collective variables. We break the “up”/“down” folding degeneracy by keeping track of the dihedral angle on the interval [0,2π]. As the simulation is running we also compute the energy between each pair of free edges (edges not part of a hinge) on the net. If the potential energy between two edges is less than Ebond=5ϵ, then the edges are considered to be bonded, and a list of bonded edges is recorded along with the list of dihedral angles. All intermediates are then clustered using DBSCAN (42) with a variation of the Manhattan metric, d(i,j)=minαAut(Gnet)max|aα(i),kaj,k|, which is a way to compare the dihedral angles of different states taking into account the symmetry of the net. Using the bonding information, we turn the molecular dynamics (MD) model into a graph, Gint. By looking at the graph automorphisms we can determine whether the symmetry could lead to a relabeling of the vertices of the net. If so, clusters returned by the DBSCAN algorithm were merged.

To build the MSM we ran 125 independent simulations at constant volume and temperature for 12.5×106 steps and then branched the trajectories using new random seeds. This process was repeated until we obtained a total of 1,875 (14×125) trajectories (or, equivalently, 2.3×1010 time steps) for each net and each temperature. Bonded edges and dihedral angles for each hinge were computed every 10 time steps and combined to define a state in the MSM described above. The lag time, τ, was found by the standard protocol of identifying the time at which the eigenvalues of the transition probability matrix become constant (SI Appendix, Fig. S7). We used transition path theory (23, 43, 44) to determine the reactive flux, fij, of all intermediates. The reactive flux is defined as fij=qj+πiPijqi, where qj+ is the forward committor probability (the probability that the net will fold from state j), πi is the probability of being in state i, Pij is the probability of transitioning to state j given the system is in state i, and qi is the backward committor probability (the probability that the net is folding, as opposed to unfolding). Finally, the net flux is defined as fij+=max{fijfji,0}. The dominant paths were computed via the “bottleneck” algorithm, using the net fluxes (23, 43). The total reactive flux is defined as the sum of the reactive flux out of the unfolded state, F=ifui, where u is the unfolded state. The folding rate is then kfold=F/τπr, where πr is the probability that the pathway is moving forward.

Folding Parameters.

The number of native contacts, Q, was calculated by counting the number of edges that were bonded to the correct corresponding edge according to the criteria described above. The nonnative contacts were calculated similarly. The diameter is the graph diameter of the face graph of the net. In general the number of degrees of freedom can be difficult to calculate because it can be difficult to deduce which constraints are redundant in the net. In general one can use the pebble game (45); however, if the linkage is not generic or has point group symmetries, the pebble game can underestimate the number of degrees of freedom (46, 47). First, we applied the pebble game to each intermediate, and then for closed-loop motifs we applied a closed-loop formula to determine the number of degrees of freedom (48); finally, intermediates with high degrees of symmetry were checked by hand, since the pebble game is known to underestimate these cases (46, 47).

Enumerating High-Temperature Pathways.

An exhaustive search was performed to enumerate high-T pathways. Two principles were assumed to be important for the folding pathways at high temperature: local bonds and maximizing number of degrees of freedom. We initialize the algorithm by adding the unfolded state to the queue and creating an empty graph that will contain the pathway information. For each intermediate on the queue, a set of candidate bonds was calculated by finding edges on the intermediate that still needed to be bonded that also had a topological distance of one (local). This intermediate was then added to a queue for further processing, and a link between the current state and the candidate state is made in the graph. Finally, the pathways are taken from the graph and sorted lexicographically by the sequence of degrees of freedom of each intermediate along the pathway. The pathways that have the largest number of degrees of freedom are then returned.

Supplementary Material

Supplementary File

Acknowledgments

This work was supported in part by the National Science Foundation, Emerging Frontiers in Research and Innovation (EFRI) Award EFRI-1240264 (to P.M.D.) and as part of the Center for Bio-Inspired Energy Science, an Energy Frontier Research Center funded by the US Department of Energy, Office of Science, Basic Energy Sciences, under Award DE-SC0000989. P.F.D. acknowledges support from the University of Michigan Rackham Predoctoral Fellowship Program. Computational work used the Extreme Science and Engineering Discovery Environment (XSEDE), which is supported by National Science Foundation Grant ACI-1053575, XSEDE Award DMR 140129, and was also supported in part through computational resources and services provided by Advanced Research Computing at the University of Michigan, Ann Arbor.

Footnotes

The authors declare no conflict of interest.

This article contains supporting information online at www.pnas.org/lookup/suppl/doi:10.1073/pnas.1722681115/-/DCSupplemental.

References

  • 1.Shephard GC. Convex polytopes with convex nets. Math Proc Cambridge Philos Soc. 1975;78:389–403. [Google Scholar]
  • 2.Schlickenrieder W. 1997. Nets of polyhedra. PhD thesis (Technische Universitat, Berlin)
  • 3.Demaine ED, O’Rourke J. Geometric Folding Algorithms: Linkages, Origami, Polyhedra. Cambridge Univ Press; New York: 2007. [Google Scholar]
  • 4.Fernandes R, Gracias D. Self-folding polymeric containers for encapsulation and delivery of drugs. Adv Drug Deliv Rev. 2012;64:1–11. doi: 10.1016/j.addr.2012.02.012. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 5.Felton S, Tolley M, Demaine E, Rus D, Wood R. A method for building self-folding machines. Science. 2014;345:644–646. doi: 10.1126/science.1252610. [DOI] [PubMed] [Google Scholar]
  • 6.Liu Y, Boyles JK, Genzer J, Dickey MD. Self-folding of polymer sheets using local light absorption. Soft Matter. 2012;8:1764–1769. [Google Scholar]
  • 7.Shim TS, Kim SH, Heo CJ, Jeon HC, Yang SM. Controlled origami folding of hydrogel bilayers with sustained reversibility for robust microcarriers. Angew Chem. 2012;124:1449–1452. doi: 10.1002/anie.201106723. [DOI] [PubMed] [Google Scholar]
  • 8.Pandey S, Ewing M. Algorithmic design of self-folding polyhedra. Proc Natl Acad Sci USA. 2011;108:19885–19890. doi: 10.1073/pnas.1110857108. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 9.Kuribayashi-Shigetomi K, Onoe H, Takeuchi S. Cell origami: Self-folding of three dimensional cell-laden microstructures driven by cell traction force. PLoS One. 2012;7:e51085. doi: 10.1371/journal.pone.0051085. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 10.Shenoy V, Gracias D. Self-folding thin-film materials: From nanopolyhedra to graphene origami. MRS Bull. 2012;37:847–854. [Google Scholar]
  • 11.Dill KA, Ozkan SB, Weikl TR, Chodera JD, Voelz VA. The protein folding problem: When will it be solved? Curr Opin Struct Biol. 2007;17:342–346. doi: 10.1016/j.sbi.2007.06.001. [DOI] [PubMed] [Google Scholar]
  • 12.Shyu TC, et al. A kirigami approach to engineering elasticity in nanocomposites through patterned defects. Nat Mater. 2015;14:785–789. doi: 10.1038/nmat4327. [DOI] [PubMed] [Google Scholar]
  • 13.Blees MK, et al. Graphene kirigami. Nature. 2015;524:204–207. doi: 10.1038/nature14588. [DOI] [PubMed] [Google Scholar]
  • 14.Sussman DM, et al. Algorithmic lattice kirigami: A route to pluripotent materials. Proc Natl Acad Sci USA. 2015;112:7449–7453. doi: 10.1073/pnas.1506048112. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 15.Azam A, Leong TG, Zarafshar AM, Gracias DH. Compactness determines the success of cube and octahedron self-assembly. PLoS One. 2009;4:e4451. doi: 10.1371/journal.pone.0004451. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 16.Kaplan R, Klobušický J, Pandey S. Building polyhedra by self-assembly: Theory and experiment. Artif Life. 2014;20:409–439. doi: 10.1162/ARTL_a_00144. [DOI] [PubMed] [Google Scholar]
  • 17.Buekenhout F, Parker M. The number of nets of the regular convex polytopes in dimension? 4. Discrete Math. 1998;186:69–94. [Google Scholar]
  • 18.Araújo NAM, da Costa RA, Dorogovtsev SN, Mendes JFF. Finding the optimal nets for self-folding kirigami. Phys Rev Lett. 2018;120:188001. doi: 10.1103/PhysRevLett.120.188001. [DOI] [PubMed] [Google Scholar]
  • 19. Dodd PM (2018) Data from “Polyhedra nets.” Bitbucket. https://bitbucket.org/the_real_pdodd/polyhedra_nets.
  • 20.Meng G, Arkus N, Brenner MP, Manoharan VN. The free-energy landscape of clusters of attractive hard spheres. Science. 2010;327:560–563. doi: 10.1126/science.1181263. [DOI] [PubMed] [Google Scholar]
  • 21.Swope WC, Pitera JW, Suits F. Describing protein folding kinetics by molecular dynamics simulations. 1. Theory†. J Phys Chem B. 2004;108:6571–6581. [Google Scholar]
  • 22.Bowman GR, Pande VS. Protein folded states are kinetic hubs. Proc Natl Acad Sci USA. 2010;107:10890–10895. doi: 10.1073/pnas.1003962107. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 23.Noé F, Schütte C, Vanden-Eijnden E, Reich L, Weikl TR. Constructing the equilibrium ensemble of folding pathways from short off-equilibrium simulations. Proc Natl Acad Sci USA. 2009;106:19011–19016. doi: 10.1073/pnas.0905466106. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 24.Long AW, Ferguson AL. Nonlinear machine learning of patchy colloid self-assembly pathways and mechanisms. J Phys Chem B. 2014;118:4228–4244. doi: 10.1021/jp500350b. [DOI] [PubMed] [Google Scholar]
  • 25.Bonneau R, Ruczinski I, Tsai J, Baker D. 2002. Contact order ab initio protein structure prediction Protein Sci 11:1937–1944.
  • 26.Best RB, Hummer G, Eaton WA. Native contacts determine protein folding mechanisms in atomistic simulations. Proc Natl Acad Sci USA. 2013;110:17874–17879. doi: 10.1073/pnas.1311599110. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 27.Socci ND, Onuchic JN, Wolynes PG. Protein folding mechanisms and the multidimensional folding funnel. Proteins Struct Funct Genet. 1998;32:136–158. [PubMed] [Google Scholar]
  • 28.Dill KA, Fiebig KM, Chan HS. Cooperativity in protein-folding kinetics. Proc Natl Acad Sci USA. 1993;90:1942–1946. doi: 10.1073/pnas.90.5.1942. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 29.Glotzer SC, Solomon MJ. Anisotropy of building blocks and their assembly into complex structures. Nat Mater. 2007;6:557–562. doi: 10.1038/nmat1949. [DOI] [PubMed] [Google Scholar]
  • 30.Agarwal U, Escobedo FA. Mesophase behaviour of polyhedral particles. Nat Mater. 2011;10:230–235. doi: 10.1038/nmat2959. [DOI] [PubMed] [Google Scholar]
  • 31.de Graaf J, Manna L. A roadmap for the assembly of polyhedral particles. Science. 2012;337:417–418. doi: 10.1126/science.1226162. [DOI] [PubMed] [Google Scholar]
  • 32.Damasceno PF, Engel M, Glotzer SC. Predictive self-assembly of polyhedra into complex structures. Science. 2012;337:453–457. doi: 10.1126/science.1220869. [DOI] [PubMed] [Google Scholar]
  • 33.Zhang F, et al. Complex wireframe DNA origami nanostructures with multi-arm junction vertices. Nat Nanotechnol. 2015;10:779–784. doi: 10.1038/nnano.2015.162. [DOI] [PubMed] [Google Scholar]
  • 34.Kruskal JB. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc Am Math Soc. 1956;7:48–50. [Google Scholar]
  • 35. HOOMD-blue (2016) Version 1.3.3. Available at codeblue.umich.edu/hoomd-blue. Accessed February 1, 2016.
  • 36.Anderson JA, Lorenz CD, Travesset A. General purpose molecular dynamics simulations fully implemented on graphics processing units. J Comput Phys. 2008;227:5342–5359. [Google Scholar]
  • 37.Nguyen TD, Phillips CL, Anderson JA, Glotzer SC. Rigid body constraints realized in massively-parallel molecular dynamics on graphics processing units. Comput Phys Commun. 2011;182:2307–2313. [Google Scholar]
  • 38.Glaser J, et al. Strong scaling of general-purpose molecular dynamics simulations on GPUs. Comput Phys Commun. 2015;192:97–107. [Google Scholar]
  • 39.Perkett MR, Hagan MF. Using Markov state models to study self-assembly. J Chem Phys. 2014;140:214101. doi: 10.1063/1.4878494. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 40.Allen RJ, Valeriani C, ten Wolde PR. Forward flux sampling for rare event simulations. J Phys Condens Matter. 2009;21:463102. doi: 10.1088/0953-8984/21/46/463102. [DOI] [PubMed] [Google Scholar]
  • 41.Jankowski E, Glotzer SC. A comparison of new methods for generating energy minimizing configurations of patchy particles. J Chem Phys. 2009;131:104104. [Google Scholar]
  • 42.Ester M, Kriegel HP, Sander J, Xu X. A density-based algorithm for discovering clusters in large spatial databases with noise. In: Simoudis E, Han J, Fayyad U, editors. Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD-96) AAAI Press; Menlo Park, CA: 1996. pp. 226–231. [Google Scholar]
  • 43.Metzner P, Schütte C, Vanden-Eijnden E. 2009. Transition path theory for Markov jump processes, Multiscale Model Simul 7:1192–1219. [DOI] [PubMed]
  • 44.Weinan E, Vanden-Eijnden E. Transition-path theory and path-finding algorithms for the study of rare events. Annu Rev Phys Chem. 2010;61:391–420. doi: 10.1146/annurev.physchem.040808.090412. [DOI] [PubMed] [Google Scholar]
  • 45.Lee A, Streinu I. Pebble game algorithms and sparse graphs. Discrete Math. 2008;308:1425–1437. [Google Scholar]
  • 46.Schulze B, ichi Tanigawa S. Linking rigid bodies symmetrically. Eur J Comb. 2014;42:145–166. [Google Scholar]
  • 47.Schulze B, Sljoka A, Whiteley W. How does symmetry impact the flexibility of proteins? Philos Trans Ser A Math Phys Eng Sci. 2014;372:20120041. doi: 10.1098/rsta.2012.0041. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 48.Tay TS. Rigidity of multi-graphs. I. Linking rigid bodies in n-space. J Comb Theor Ser B. 1984;36:95–112. [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Supplementary Materials

Supplementary File

Articles from Proceedings of the National Academy of Sciences of the United States of America are provided here courtesy of National Academy of Sciences

RESOURCES